Problem: You are given n strings s1, s2, ..., sn consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operation the concatenation saisbi is saved into a new string sn + i (the operations are numbered starting from 1). After each operation you need to find the maximum positive integer k such that all possible strings consisting of 0 and 1 of length k (there are 2k such strings) are substrings of the new string. If there is no such k, print 0.

Input

The first line contains single integer n (1 ≤ n ≤ 100) — the number of strings. The next n lines contain strings s1, s2, ..., sn (1 ≤ |si| ≤ 100), one per line. The total length of strings is not greater than 100.

The next line contains single integer m (1 ≤ m ≤ 100) — the number of operations. m lines follow, each of them contains two integers ai abd bi (1 ≤ ai, bi ≤ n + i - 1) — the number of strings that are concatenated to form sn + i.

Output

Print m lines, each should contain one integer — the answer to the question after the corresponding operation.

Example

Input

5
01
10
101
11111
0
3
1 2
6 5
4 4


Output

1
2
0

Note

On the first operation, a new string "0110" is created. For k = 1 the two possible binary strings of length k are "0" and "1", they are substrings of the new string. For k = 2 and greater there exist strings of length k that do not appear in this string (for k = 2 such string is "00"). So the answer is 1.

On the second operation the string "01100" is created. Now all strings of length k = 2 are present.

On the third operation the string "1111111111" is created. There is no zero, so the answer is 0.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int size_check(string root) {
  for (int i = 10; i >= 0; i--) {
    bool flag = true;
    for (int j = 0; j < pow(2, i); j++) {
      string str;
      for (int k = 0; k < i; k++) {
        if (j & (1 << k))
          str += '1';
        else
          str += '0';
      }
      if (root.find(str) == string::npos) {
        flag = false;
        break;
      }
    }
    if (flag) return i;
  }
}
int main() {
  int n, m;
  string s1[300];
  int arr[300];
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> s1[i];
    arr[i] = size_check(s1[i]);
  }
  cin >> m;
  for (int q = 0; q < m; q++) {
    int l, r;
    cin >> l >> r;
    l--;
    r--;
    s1[n] = s1[l] + s1[r];
    if (s1[n].length() > 1024) {
      s1[n] = s1[n].substr(0, 500) + s1[n].substr(s1[n].length() - 500, 500);
    }
    arr[n] = max(max(arr[l], arr[r]), size_check(s1[n]));
    cout << arr[n] << endl;
    n++;
  }
  return 0;
}