Problem: You are the God of Wind.

By moving a big cloud around, you can decide the weather: it invariably rains under the cloud, and the sun shines everywhere else.

But you are a benign God: your goal is to give enough rain to every field in the countryside, and sun to markets and festivals. Small humans, in their poor vocabulary, only describe this as “weather forecast”.

You are in charge of a small country, called Paccimc. This country is constituted of 4 × 4 square areas, denoted by their numbers.

<image>

Your cloud is of size 2 × 2, and may not cross the borders of the country.

You are given the schedule of markets and festivals in each area for a period of time.

On the first day of the period, it is raining in the central areas (6-7-10-11), independently of the schedule.

On each of the following days, you may move your cloud by 1 or 2 squares in one of the four cardinal directions (North, West, South, and East), or leave it in the same position. Diagonal moves are not allowed. All moves occur at the beginning of the day.

You should not leave an area without rain for a full week (that is, you are allowed at most 6 consecutive days without rain). You don’t have to care about rain on days outside the period you were given: i.e. you can assume it rains on the whole country the day before the period, and the day after it finishes.



Input

The input is a sequence of data sets, followed by a terminating line containing only a zero.

A data set gives the number N of days (no more than 365) in the period on a single line, followed by N lines giving the schedule for markets and festivals. The i-th line gives the schedule for the i-th day. It is composed of 16 numbers, either 0 or 1, 0 standing for a normal day, and 1 a market or festival day. The numbers are separated by one or more spaces.

Output

The answer is a 0 or 1 on a single line for each data set, 1 if you can satisfy everybody, 0 if there is no way to do it.

Example

Input

1
0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0
7
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 1 0 0 0 0 1 1 0 0 1
0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 1
0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0
0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0
7
0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0
0 0 1 0 0 0 0 1 0 0 0 0 0 1 0 0
0 0 0 1 0 0 0 0 0 0 1 0 1 0 0 0
0 1 0 0 0 0 0 1 0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 1 0 1 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0
15
0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 1 0 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0
0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0
1 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0
0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0
0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0
1 0 0 1 1 0 0 0 0 1 0 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 0
0


Output

0
1
0
1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 400;
const int R = 4;
const int W = 7;
const int di[] = {0,1,0,-1};
const int dj[] = {1,0,-1,0};
int N;
int F[MAXN][R][R];
bool dp[MAXN][R][R][W][W][W][W];

int main() {
  while(cin >> N && N) {
    for(int k = 0; k < N; ++k)
      for(int i = 0; i < R; ++i)
        for(int j = 0; j < R; ++j)
          cin >> F[k][i][j];
    memset(dp, 0, sizeof(dp));
    dp[0][1][1][0][0][0][0] = 1;
    bool ok = false;
    for(int k = 0; k < N; ++k)
      for(int i = 0; i < R; ++i)
        for(int j = 0; j < R; ++j)
          for(int a = 0; a < W; ++a)
            for(int b = 0; b < W; ++b)
              for(int c = 0; c < W; ++c)
                for(int d = 0; d < W; ++d) {
                  if(!dp[k][i][j][a][b][c][d]) continue;
                  for(int s = 0; s < 4; ++s)
                    for(int l = 0; l <= 2; ++l) {
                      if(k == 0 && l) continue;
                      int ni = i + di[s] * l;
                      int nj = j + dj[s] * l;
                      if(ni < 0 || ni + 1 >= R) continue;
                      if(nj < 0 || nj + 1 >= R) continue;
                      if(F[k][ni][nj]) continue;
                      if(F[k][ni][nj+1]) continue;
                      if(F[k][ni+1][nj]) continue;
                      if(F[k][ni+1][nj+1]) continue;
                      int na = (ni == 0 && nj == 0 ? 0 : a + 1);
                      int nb = (ni == 0 && nj+1 == R-1 ? 0 : b + 1);
                      int nc = (ni+1 == R-1 && nj == 0 ? 0 : c + 1);
                      int nd = (ni+1 == R-1 && nj+1 == R-1 ? 0 : d + 1);
                      if(max(max(na,nb),max(nc,nd)) >= W) continue;
                      dp[k+1][ni][nj][na][nb][nc][nd] = true;
                      if(k+1 == N) ok = true;
                    }
                }
    cout << ok << endl;
  }
  return 0;
}