C. LaLa and Lamp
time limit per test
3 seconds
memory limit per test
1024 megabytes
input
standard input
output
standard output

When $$$\color{blue}{\text{LaLa}}$$$ laid down on her pet $$$\color{brown}{\text{Leo}}$$$'s back to fall asleep, she noticed that the lamp is all messed up, which must have been the act of her sister $$$\color{purple}{\text{LiLi}}$$$.

The lamp can be modeled as a regular triangular grid where each cell contains a bulb which is either on or off.

$$$\color{blue}{\text{LaLa}}$$$ wants to turn off the lamp (that is, set the state of all bulbs to off). $$$\color{blue}{\text{LaLa}}$$$ can pick any of the three directions parallel to the side of a lamp, pick any row parallel to that direction, and then flip the state of all the bulbs in the row (on to off and off to on) with her $$$\color{red}{\text{m}} \color{brown}{\text{a}} \color{orange}{\text{g}} \color{blue}{\text{i}} \color{magenta} {\text{c}}$$$. $$$\color{blue}{\text{LaLa}}$$$ also could just walk over to the lamp and manually turn every bulb off, but she would prefer not to.

Write a program that determines whether $$$\color{blue}{\text{LaLa}}$$$ can turn off the lamp with her $$$\color{red}{\text{m}} \color{brown}{\text{a}} \color{orange}{\text{g}} \color{blue}{\text{i}} \color{magenta} {\text{c}}$$$.

Input

The input is given in the following format:

$$$N$$$
$$$S_0$$$
$$$S_1$$$
$$$\vdots$$$
$$$S_{N-1}$$$

where $$$N$$$ is the number of bulbs in a side of the lamp, and $$$S_i$$$ is the binary string of length $$$i+1$$$ representing the initial states of bulbs in the $$$i$$$-th row, where the $$$j$$$-th character of $$$S_i$$$ is '1' if and only if the $$$j$$$-th bulb is on.

The input satisfies the following constraint:

  • $$$N$$$ is an integer.
  • $$$2 \le N \le 2\,000$$$
Output

If $$$\color{blue}{\text{LaLa}}$$$ can turn off the lamp with $$$\color{red}{\text{m}} \color{brown}{\text{a}} \color{orange}{\text{g}} \color{blue}{\text{i}} \color{magenta} {\text{c}}$$$, print a single string "Yes". Otherwise, print a single string "No". You may print each character in either case (lower or upper).

Example
Input
6
0
00
000
0110
00100
000000
Output
Yes
Note

The following illustrates a sequence of $$$\color{red}{\text{m}} \color{brown}{\text{a}} \color{orange}{\text{g}} \color{blue}{\text{i}} \color{magenta} {\text{c}}$$$ $$$\color{blue}{\text{LaLa}}$$$ should cast to turn off the lamp given in the sample. Empty circles denote the bulbs that are off, yellow circles denote the bulbs that are on, and red line is the choosen row for $$$\color{red}{\text{m}} \color{brown}{\text{a}} \color{orange}{\text{g}} \color{blue}{\text{i}} \color{magenta} {\text{c}}$$$.

Step 0Step 1Step 2
Step 3Step 4Step 5
Step 6