X = ''
for i in range(int(input())):
X+=input()
print("YES" if X==X[::-1] else "NO")#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
char board[n][n];
bool even = true;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> board[i][j];
for (int i = 0; i < n; i++)
{
int c = 0;
for (int j = 0; j < n; j++)
{
if (i - 1 >= 0 and board[i - 1][j] == 'o')
c++;
if (i + 1 < n and board[i + 1][j] == 'o')
c++;
if(j - 1 >= 0 and board[i][j - 1] == 'o')
c++;
if(j + 1 < n and board[i][j + 1] == 'o')
c++;
if (c % 2 == 1)
even = false;
}
}
if (even)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |