CF462A.Appleman and Easy Task

传统题 时间 2000 ms 内存 256 MiB 5 尝试 1 已通过 1 标签

Appleman and Easy Task

Toastman came up with a very easy task. He gives it to Appleman, but Appleman doesn't know how to solve it. Can you help him?

Given a n × n checkerboard. Each cell of the board has either character 'x', or character 'o'. Is it true that each cell of the board has even number of adjacent cells with 'o'? Two cells of the board are adjacent if they share a side.

Input

The first line contains an integer n (1 ≤ n ≤ 100). Then n lines follow containing the description of the checkerboard. Each of them contains n characters (either 'x' or 'o') without spaces.

Output

Print "YES" or "NO" (without the quotes) depending on the answer to the problem.

Samples

3
xxo
xox
oxx
YES
4
xxxo
xoxo
oxox
xxxx
NO

在线编程 IDE

建议全屏模式获得最佳体验