import java.util.Scanner;
 
class Solution
{
    static boolean[][] visited;
    static int[][] map = new int[100][100];
    static int[] dx={-1, 1, 0, 0};
    static int[] dy={0, 0, -1, 1};
    static int cnt=0;
 
    public static void main(String args[]) throws Exception
    {
        Scanner sc = new Scanner(System.in);
        int T=10;
 
        for(int test_case = 1; test_case <= T; test_case++)
        {
            int N=sc.nextInt();
            int min=Integer.MAX_VALUE;
            int index=0;
            for(int i=0; i<100; i++) {
                for(int j=0; j<100; j++) {
                    map[i][j]=sc.nextInt();
                }
            }
            for(int k=0; k<100; k++) {
 
                if(map[0][k]==1){
                    cnt=1;
                    visited = new boolean[100][100];
                    visited[0][k]=true;
                    DFS(new Pair(0, k));
                     
                    if(min>cnt) {
                        min=cnt;
                        index=k;
                    }
                }
            }
            System.out.println("#"+N+" "+index);
        }
    }
 
    public static void DFS(Pair p) {
        int x=p.x;
        int y=p.y;
 
        for(int i=3; i>=1; i--) {
            int X=x+dx[i];
            int Y=y+dy[i];
             
            if(X>=0 && X<=99 && Y<=99 && Y>=0) {
                if (X == 99)
                    return;
                if (visited[X][Y] == false && map[X][Y] == 1) {
                    cnt++;
                    visited[X][Y] = true;
                    DFS(new Pair(X, Y));
                    return;
                }
            }
        }
    }
    static class Pair {
        int x;
        int y;
 
        public Pair(int x, int y) {
            this.x=x;
            this.y=y;
        }
    }
}