CF982A.Row

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

给你一排 $n$ 把椅子。我们称一种就座方式为“极大”的，当且仅当满足以下两个条件：

1. 任意就座者均不与他人相邻；
2. 无法再安排任何一人入座而不违反第一条规则。

给定的就座情况用一个由 0 和 1 组成的字符串表示（0 表示对应座位为空，1 表示已被占用）。你的任务是判断该就座方式是否为“极大”的。

注意：首尾座位不视为相邻（当 $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.

第一行包含一个整数 $n$（$1 \leq n \leq 1000$）——椅子的数量。

下一行包含一个长度为 $n$ 的字符串，其中每个字符为 0 或 1，用于描述座位安排。

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

如果座位安排是“最大化的”，则输出“Yes”（不带引号）；否则输出“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.

在样例一中，给定的就座安排是最大化的。

在样例二中，坐在三号椅子上的人右侧有邻座。

在样例三中，还可以在三号椅子上再安排一个人就座。