CF982A.Row

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You're given a row with $n$ chairs. We call a seating of people "maximal" if the two following conditions hold:

There are no neighbors adjacent to anyone seated.
It's impossible to seat one more person without violating the first rule.

The seating is given as a string consisting of zeros and ones ( $0$ means that the corresponding seat is empty, $1$ — occupied). The goal is to determine whether this seating is "maximal".

Note that the first and last seats are not adjacent (if $n \ne 2$ ).

输入格式

The first line contains a single integer $n$ ( $1 \leq n \leq 1000$ ) — the number of chairs.

The next line contains a string of $n$ characters, each of them is either zero or one, describing the seating.

输出格式

Output "Yes" (without quotation marks) if the seating is "maximal". Otherwise print "No".

You are allowed to print letters in whatever case you'd like (uppercase or lowercase).

输入输出样例

输入#1
```
3
101
```
输出#1
```
Yes
```
输入#2
```
4
1011
```
输出#2
```
No
```
输入#3
```
5
10001
```
输出#3
```
No
```

说明/提示

In sample case one the given seating is maximal.

In sample case two the person at chair three has a neighbour to the right.

In sample case three it is possible to seat yet another person into chair three.

首页