#include <bits/stdc++.h>
using namespace std;
bitset<1 << (14 + 1)> possib[202][14 + 1];
vector<string> prefix, suffix;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  for (int i = 0; i < 202; i++)
    for (int j = 0; j < 14 + 1; j++) possib[i][j].reset();
  int n;
  cin >> n;
  string s;
  int pos = 0;
  while (n--) {
    cin >> s;
    int size = s.size();
    prefix.push_back(s.substr(0, min(14, size)));
    suffix.push_back(s.substr(max(0, size - 14), min(14, size)));
    for (int i = 1; i <= min(14, size); i++) {
      int temp = 0;
      for (int j = 0; j < i; j++) temp = temp * 2 + (s[j] - '0');
      possib[pos][i].set(temp, true);
      for (int j = i; j < size; j++) {
        temp = temp * 2 + (s[j] - '0');
        temp = temp % (1 << i);
        possib[pos][i].set(temp, true);
      }
    }
    pos++;
  }
  int m;
  cin >> m;
  int a, b;
  while (m--) {
    cin >> a >> b;
    a--;
    b--;
    for (int i = 1; i <= 14; i++) {
      for (int j = 0; j < (1 << i); j++) {
        if (possib[a][i][j] | possib[b][i][j]) {
          possib[pos][i].set(j, true);
        }
      }
    }
    s = suffix[a] + prefix[b];
    int size = s.size();
    for (int i = 1; i <= min(14, size); i++) {
      int temp = 0;
      for (int j = 0; j < i; j++) temp = temp * 2 + (s[j] - '0');
      possib[pos][i].set(temp, true);
      for (int j = i; j < size; j++) {
        temp = temp * 2 + (s[j] - '0');
        temp = temp % (1 << i);
        possib[pos][i].set(temp, true);
      }
    }
    s = prefix[a] + prefix[b];
    size = s.size();
    prefix.push_back(s.substr(0, min(14, size)));
    s = suffix[a] + suffix[b];
    size = s.size();
    suffix.push_back(s.substr(max(0, size - 14), min(14, size)));
    int k = 0;
    for (int i = 1; i <= 14; i++)
      if (possib[pos][i].count() == (1 << i)) k = i;
    cout << k << "\n";
    pos++;
  }
  return 0;
}
