Codeforces Round #484 (Div. 2)

A. Row

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

1. There are no neighbors adjacent to anyone seated.
2. 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$).

Input

The first line contains a single integer $n$ ($1\le n\le 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

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).

Examples

input

Copy

3
101

output

Copy

Yes

input

Copy

4
1011

output

Copy

No

input

Copy

5
10001

output

Copy

No

Note

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.

枚举即可。

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int maxn=100005,inf=0x3f3f3f3f;  
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);
char s[maxn];

int main() {
	int n;
	scanf("%d",&n);
	scanf("%s",s+1);
	int flag=1;
	for (int i=1;i<=n;i++) {
		if (s[i]=='1'){
			if ((s[i-1]=='1'&&i!=1)||(s[i+1]=='1'&&i!=n)) flag=0;
		} else {
			if ((s[i-1]=='0'||i==1)&&(s[i+1]=='0'||i==n)) flag=0;
		}
	}
	if (flag) cout << "yes"; else cout << "no";
	return 0;
}

B. Bus of Characters

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In the Bus of Characters there are $n$ rows of seat, each having $2$ seats. The width of both seats in the $i$-th row is $w_i$ centimeters. All integers