#include <algorithm>

#include <bitset>

#include <cctype>

#include <cerrno>

#include <clocale>

#include <cmath>

#include <complex>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <deque>

#include <exception>

#include <fstream>

#include <functional>

#include <limits>

#include <list>

#include <map>

#include <iomanip>

#include <ios>

#include <iosfwd>

#include <iostream>

#include <istream>

#include <ostream>

#include <queue>

#include <set>

#include <sstream>

#include <stdexcept>

#include <streambuf>

#include <string>

#include <utility>

#include <vector>

#include <cwchar>

#include <cwctype>

#include <stack>

#include <limits.h>

using namespace std;

#define MAXN 400

const int dx[] = {,-,-,,,,,,};

const int dy[] = {,,,-,-,,,,};

int i,j,k,n;

int a[MAXN][][];

bool visited[][][MAXN][][][][];

struct info

{

        int x,y,day;

        int s1,s2,s3,s4;

};

inline bool check(int x,int y,int day,int s1,int s2,int s3,int s4)

{

        if (x <=  || x >  || y <=  || y > ) return false;

        if (a[day][x][y] == ) return false;

        if (a[day][x][y+] == ) return false;

        if (a[day][x+][y] == ) return false;

        if (a[day][x+][y+] == ) return false;

        if (s1 >=  || s2 >=  || s3 >=  || s4 >= ) return false;

        return true;

}

inline bool bfs()

{

        int i,sa,sb,sc,sd,tx,ty;

        queue< info > q;

        info cur;

        if (a[][][] || a[][][] || a[][][] || a[][][]) return false;

        memset(visited,false,sizeof(visited));

        while (!q.empty()) q.pop();

        q.push((info){,,,,,,});

        visited[][][][][][][] = true;

        while (!q.empty())

        {

                cur = q.front();

                q.pop();

                if (cur.day == n) return true;

                for (i = ; i < ; i++)

                {

                        tx = cur.x + dx[i];

                        ty = cur.y + dy[i];

                        sa = cur.s1 + ;

                        sb = cur.s2 + ;

                        sc = cur.s3 + ;

                        sd = cur.s4 + ;

                        if (tx ==  && ty == ) sa = ;

                        if (tx ==  && ty == ) sb = ;

                        if (tx ==  && ty == ) sc = ;

                        if (tx ==  && ty == ) sd = ;

                        if (check(tx,ty,cur.day+,sa,sb,sc,sd) && !visited[tx][ty][cur.day+][sa][sb][sc][sd])

                        {

                                q.push((info){tx,ty,cur.day+,sa,sb,sc,sd});

                                visited[tx][ty][cur.day+][sa][sb][sc][sd] = true;

                        }

                }

        }

        return false;

}

int main()

{

        while (scanf("%d",&n) != EOF && n)

        {

                for (i = ; i <= n; i++)

                {

                        for (j = ; j <= ; j++)

                        {

                                for (k = ; k <= ; k++)

                                {

                                        scanf("%d",&a[i][j][k]);

                                }

                        }

                }

                if (bfs()) printf("%d\n",);

                else printf("%d\n",);

        }

        return ;

}