//Julian
//Recursion Maze
//Comp Sci II AP

import java.io.*;
import java.util.*;
public class recursion
{
	public static void main(String[] args) throws IOException
	{
		Scanner file=new Scanner(new File("recursion.txt"));
		int length=file.nextInt();
		int[][] maze=new int[length][length];
		for(int x=0;x<length;x++)
		{
			for(int y=0;y<length;y++)
			{
				maze[x][y]=file.nextInt();
			}
		}
		mazeSolver ms=new mazeSolver();
		ms.mazeSolver(maze);ms.solving(0,0);
		System.out.println(ms);
	}
}
class mazeSolver
{
	boolean exitFound=false;
	int[][] maze;
	public void mazeSolver(int[][] m)
	{
		maze=m;
	}
	public boolean solving(int r,int c)
	{
		if(r>=0&&c>=0&&r<maze.length&&c<maze.length&&maze[r][c]==1)
		{
			maze[r][c]=2;
			if(r==maze.length-1&&c==maze.length-1)
			{
				exitFound=true;
			}
			else
			{
				solving(r+1,c);
				solving(r-1,c);
				solving(r,c+1);
				solving(r,c-1);
			}
		}
		return exitFound;
	}
	public String toString()
	{
		String output;
		if(exitFound)
		{
			output="Exit Found";
		}
		else
		{
			output="Exit Not Found";
		}
		return output;
	}
	
}

5
1 0 0 0 0
1 1 0 1 0
0 1 1 0 1
1 0 1 1 1
0 0 1 0 1