Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

The adjacency matrix of an undirected graph is given. Determine whether it contains loops.

The first line contains the number of vertices $n(1≤n≤100)$. Then given $n$ lines with $n$ elements in each — the description of adjacency matrix.

Print "YES" if graph contains loops and "NO" otherwise.

Input #1

Answer #1

Input #2

Answer #2