Problem: You are playing the following game. There are n points on a plane. They are the vertices of a regular n-polygon. Points are labeled with integer numbers from 1 to n. Each pair of distinct points is connected by a diagonal, which is colored in one of 26 colors. Points are denoted by lowercase English letters. There are three stones positioned on three distinct vertices. All stones are the same. With one move you can move the stone to another free vertex along some diagonal. The color of this diagonal must be the same as the color of the diagonal, connecting another two stones. 

Your goal is to move stones in such way that the only vertices occupied by stones are 1, 2 and 3. You must achieve such position using minimal number of moves. Write a program which plays this game in an optimal way.

Input

In the first line there is one integer n (3 ≤ n ≤ 70) — the number of points. In the second line there are three space-separated integer from 1 to n — numbers of vertices, where stones are initially located.

Each of the following n lines contains n symbols — the matrix denoting the colors of the diagonals. Colors are denoted by lowercase English letters. The symbol j of line i denotes the color of diagonal between points i and j. Matrix is symmetric, so j-th symbol of i-th line is equal to i-th symbol of j-th line. Main diagonal is filled with '*' symbols because there is no diagonal, connecting point to itself.

Output

If there is no way to put stones on vertices 1, 2 and 3, print -1 on a single line. Otherwise, on the first line print minimal required number of moves and in the next lines print the description of each move, one move per line. To describe a move print two integers. The point from which to remove the stone, and the point to which move the stone. If there are several optimal solutions, print any of them.

Examples

Input

4
2 3 4
*aba
a*ab
ba*b
abb*


Output

1
4 1


Input

4
2 3 4
*abc
a*ab
ba*b
cbb*


Output

-1

Note

In the first example we can move stone from point 4 to point 1 because this points are connected by the diagonal of color 'a' and the diagonal connection point 2 and 3, where the other stones are located, are connected by the diagonal of the same color. After that stones will be on the points 1, 2 and 3.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct node {
  int b[4];
  int n;
};
struct stepnode {
  int value;
  int fr, to;
};
int N;
char data[71][71];
static struct stepnode mini_step[71][71][71] = {0};
static bool is_visited[71][71][71] = {false};
std::queue<struct node> my_queue;
void my_sort(int *b) {
  for (int i = 2; i < 4; i++) {
    int j, t;
    t = b[i];
    j = i - 1;
    while (j >= 1 && b[j] > t) {
      b[j + 1] = b[j];
      j--;
    }
    b[j + 1] = t;
  }
}
void print_steps(int *b) {
  int fr, to, i;
  fr = mini_step[b[1]][b[2]][b[3]].fr;
  to = mini_step[b[1]][b[2]][b[3]].to;
  if (fr == 0 && to == 0) {
    return;
  }
  for (i = 1; i <= 3 && b[i] != to; i++)
    ;
  b[i] = fr;
  my_sort(b);
  print_steps(b);
  cout << fr << ' ' << to << endl;
}
int main(int argc, char **argv) {
  int i, j, k, m;
  int b[4];
  char ch;
  struct node my_node, my_node1;
  cin >> N;
  cin >> my_node.b[1] >> my_node.b[2] >> my_node.b[3];
  my_sort(my_node.b);
  b[1] = my_node.b[1];
  b[2] = my_node.b[2];
  b[3] = my_node.b[3];
  for (i = 1; i <= N; i++) {
    for (j = 1; j <= N; j++) {
      cin >> data[i][j];
    }
  }
  my_node.n = 0;
  my_queue.push(my_node);
  is_visited[b[1]][b[2]][b[3]] = true;
  while (is_visited[1][2][3] == false && my_queue.empty() == false) {
    my_node1 = my_queue.front();
    my_queue.pop();
    my_node = my_node1;
    ch = data[my_node.b[2]][my_node.b[3]];
    for (i = 1; i <= N; i++) {
      my_node = my_node1;
      m = my_node.b[1];
      my_node.b[1] = i;
      if (ch == data[m][i] && i != my_node.b[2] && i != my_node.b[3]) {
        my_sort(my_node.b);
        if (is_visited[my_node.b[1]][my_node.b[2]][my_node.b[3]] == false) {
          is_visited[my_node.b[1]][my_node.b[2]][my_node.b[3]] = true;
          my_node.n++;
          mini_step[my_node.b[1]][my_node.b[2]][my_node.b[3]].value = my_node.n;
          mini_step[my_node.b[1]][my_node.b[2]][my_node.b[3]].fr = m;
          mini_step[my_node.b[1]][my_node.b[2]][my_node.b[3]].to = i;
          my_queue.push(my_node);
        }
      }
    }
    my_node = my_node1;
    ch = data[my_node.b[1]][my_node.b[3]];
    for (i = 1; i <= N; i++) {
      my_node = my_node1;
      m = my_node.b[2];
      my_node.b[2] = i;
      if (ch == data[m][i] && i != my_node.b[1] && i != my_node.b[3]) {
        my_sort(my_node.b);
        if (is_visited[my_node.b[1]][my_node.b[2]][my_node.b[3]] == false) {
          is_visited[my_node.b[1]][my_node.b[2]][my_node.b[3]] = true;
          my_node.n++;
          mini_step[my_node.b[1]][my_node.b[2]][my_node.b[3]].value = my_node.n;
          mini_step[my_node.b[1]][my_node.b[2]][my_node.b[3]].fr = m;
          mini_step[my_node.b[1]][my_node.b[2]][my_node.b[3]].to = i;
          my_queue.push(my_node);
        }
      }
    }
    my_node = my_node1;
    ch = data[my_node.b[1]][my_node.b[2]];
    for (i = 1; i <= N; i++) {
      my_node = my_node1;
      m = my_node.b[3];
      my_node.b[3] = i;
      if (ch == data[m][i] && i != my_node.b[1] && i != my_node.b[2]) {
        my_sort(my_node.b);
        if (is_visited[my_node.b[1]][my_node.b[2]][my_node.b[3]] == false) {
          is_visited[my_node.b[1]][my_node.b[2]][my_node.b[3]] = true;
          my_node.n++;
          mini_step[my_node.b[1]][my_node.b[2]][my_node.b[3]].value = my_node.n;
          mini_step[my_node.b[1]][my_node.b[2]][my_node.b[3]].fr = m;
          mini_step[my_node.b[1]][my_node.b[2]][my_node.b[3]].to = i;
          my_queue.push(my_node);
        }
      }
    }
  }
  if (is_visited[1][2][3] == true) {
    cout << mini_step[1][2][3].value << endl;
  } else {
    cout << -1 << endl;
  }
  for (i = 1; i <= 3; i++) b[i] = i;
  print_steps(b);
  return 0;
}