Description

There are N cities in the graph. Given the edges between the cities. Can you find a path from city 1 to city N?

Input Format

First line: one positive integers N (N <= 100).
Next N lines: an N*N 0/1 matrix A={a[i][j]}, indicating whether there exists an edge between city i and city j (a[i][j]=1) or not (a[i][j]=0).

Output Format

One integer, 1 if there exists a path, or 0 otherwise.

4
0 1 1 0
1 0 0 1
1 0 0 0
0 1 0 0

1