Problem: The earth is under an attack of a deadly virus. Luckily, prompt actions of the Ministry of Health against this emergency successfully confined the spread of the infection within a square grid of areas. Recently, public health specialists found an interesting pattern with regard to the transition of infected areas. At each step in time, every area in the grid changes its infection state according to infection states of its directly (horizontally, vertically, and diagonally) adjacent areas.

* An infected area continues to be infected if it has two or three adjacent infected areas.
* An uninfected area becomes infected if it has exactly three adjacent infected areas.
* An area becomes free of the virus, otherwise.



Your mission is to fight against the virus and disinfect all the areas. The Ministry of Health lets an anti-virus vehicle prototype under your command. The functionality of the vehicle is summarized as follows.

* At the beginning of each time step, you move the vehicle to one of the eight adjacent areas. The vehicle is not allowed to move to an infected area (to protect its operators from the virus). It is not allowed to stay in the same area.
* Following vehicle motion, all the areas, except for the area where the vehicle is in, change their infection states according to the transition rules described above.
Special functionality of the vehicle protects its area from virus infection even if the area is adjacent to exactly three infected areas. Unfortunately, this virus-protection capability of the vehicle does not last. Once the vehicle leaves the area, depending on the infection states of the adjacent areas, the area can be infected.
The area where the vehicle is in, which is uninfected, has the same effect to its adjacent areas as an infected area as far as the transition rules are concerned.



The following series of figures illustrate a sample scenario that successfully achieves the goal.

Initially, your vehicle denoted by @ is found at (1, 5) in a 5 × 5-grid of areas, and you see some infected areas which are denoted by #'s.

<image>

Firstly, at the beginning of time step 1, you move your vehicle diagonally to the southwest, that is, to the area (2, 4). Note that this vehicle motion was possible because this area was not infected at the start of time step 1.

Following this vehicle motion, infection state of each area changes according to the transition rules. The column "1-end" of the figure illustrates the result of such changes at the end of time step 1. Note that the area (3, 3) becomes infected because there were two adjacent infected areas and the vehicle was also in an adjacent area, three areas in total.

In time step 2, you move your vehicle to the west and position it at (2, 3).

Then infection states of other areas change. Note that even if your vehicle had exactly three infected adjacent areas (west, southwest, and south), the area that is being visited by the vehicle is not infected. The result of such changes at the end of time step 2 is as depicted in "2-end".

Finally, in time step 3, you move your vehicle to the east. After the change of the infection states, you see that all the areas have become virus free! This completely disinfected situation is the goal. In the scenario we have seen, you have successfully disinfected all the areas in three time steps by commanding the vehicle to move (1) southwest, (2) west, and (3) east.

Your mission is to find the length of the shortest sequence(s) of vehicle motion commands that can successfully disinfect all the areas.



Input

The input is a sequence of datasets. The end of the input is indicated by a line containing a single zero. Each dataset is formatted as follows.

n
a11 a12 ... a1n
a21 a22 ... a2n
...
an1 an2 ... ann


Here, n is the size of the grid. That means that the grid is comprised of n × n areas. You may assume 1 ≤ n ≤ 5. The rest of the dataset consists of n lines of n letters. Each letter aij specifies the state of the area at the beginning: '#' for infection, '.' for free of virus, and '@' for the initial location of the vehicle. The only character that can appear in a line is '#', '.', or '@'. Among n × n areas, there exists exactly one area which has '@'.

Output

For each dataset, output the minimum number of time steps that is required to disinfect all the areas. If there exists no motion command sequence that leads to complete disinfection, output -1. The output should not contain any other extra character.

Examples

Input

3
...
.@.
...
3
.##
.#.
@##
3
##.
#..
@..
5
....@
##...
#....
...#.
##.##
5
#...#
...#.
#....
...##
..@..
5
#....
.....
.....
.....
..@..
5
#..#.
#.#.#
.#.#.
....#
.#@##
5
..##.
..#..
#....
#....
.#@..
0


Output

0
10
-1
3
2
1
6
4


Input

3
...
.@.
...
3
.##
.#.
@##
3
.
..
@..
5
....@
...
....
...#.
.##
5
...#
...#.
....
...##
..@..
5
....
.....
.....
.....
..@..
5
..#.
.#.#
.#.#.
....#
.#@##
5
..##.
..#..
....
....
.#@..
0


Output

0
10
-1
3
2
1
6
4

Solution (in CPP):

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

#define MAX 6
typedef pair<int, int> Pos;
typedef vector<vector<char>> Field;

const int dy[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};

int N;
int n2;
Field field;

bool WithinRange(int y, int x) {
  if (y < 0 || N <= y) return false;
  if (x < 0 || N <= x) return false;
  return true;
}

int CalcHash(Field &field) {
  int ret = 0;
  int bit = 0;
  for (int i=0; i<N; i++) {
    for (int j=0; j<N; j++) {
      bit <<= 1;
      if (field[i][j] == '#') bit |= 1;
      else if (field[i][j] == '@') {
        ret = i*N + j;
      } else assert(field[i][j] == '.');
    }
  }

  return bit*n2 + ret;
}

bool IsWall(int hash, int y, int x) {
  int idx = y*N + x;
  if (hash%n2 == idx) return true;
  hash /= n2;
  return (hash >> (n2-1-idx) & 1);
}

void Print(int g, int d) {
  printf("d[%x]: %d\n", g, d);
  int hash = g/n2;
  int _ = g%n2;
  int y = _/N;
  int x = _%N;
  printf("(%d, %d)\n", y, x);
  for (int i=0; i<N; i++) {
    for (int j=0; j<N; j++) {
      if (i == y && j == x) {
        printf("@");
        assert ((hash >> (n2-1-i*N-j) & 1) == 0);
      }
      else printf("%01d", hash >> (n2-1-i*N-j) & 1);
    }
    puts("");
  }
}

int main() {
  while (1) {
    scanf("%d", &N);
    if (N == 0) return 0;

    n2 = N*N;
    field.resize(N, vector<char>(N));
    for (int i=0; i<N; i++) {
      for (int j=0; j<N; j++) {
        scanf(" %c", &field[i][j]);
      }
    }

    queue<int> q;
    map<int, int> d;
    set<int> calced;
    int t = CalcHash(field);
    if (t/n2 == 0) {
      puts("0");
      continue;
    }

    d[t] = 0;
    q.push(t);
    while (!q.empty()) { 
      int g = q.front(); q.pop();
      if (calced.count(g)) continue;
      calced.insert(g);
      //Print(g, d[g]);
      int _ = g%n2;
      int y = _/N;
      int x = _%N;
      for (int k=0; k<8; k++) {
        int newy = y + dy[k];
        int newx = x + dx[k];
        if (!WithinRange(newy, newx)) continue;
        if (IsWall(g, newy, newx)) continue;
        int newg = g/n2*n2 + newy*N + newx;
        int nhash = 0;
        for (int i=0; i<N; i++) {
          for (int j=0; j<N; j++) {
            nhash <<= 1;
            if (i == newy && j == newx) continue;

            int cnt = 0;
            for (int l=0; l<8; l++) {
              int y = i + dy[l];
              int x = j + dx[l];
              if (!WithinRange(y, x)) continue;
              if (IsWall(newg, y, x)) cnt++;
            }

            if (IsWall(newg, i, j)) {
              if (2 <= cnt && cnt <= 3) nhash |= 1;
            } else if (cnt == 3) nhash |= 1;
          }
        }
        newg = nhash*n2 + newy*N + newx;
        if (d.count(newg)) continue;
        d[newg] = d[g]+1;
        if (newg/n2 == 0) {
          printf("%d\n", d[newg]);
          goto L_END;
        }
        q.push(newg);
      }
    }

    puts("-1");
L_END:
    continue;
  }
}