#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 300;
const int MAXK = 14;
int n, a, b, m;
string l[MAXN], r[MAXN];
set<int> hs[MAXN][MAXK];
int get_int(string p) {
  int ret = 0;
  for (int i = (0); i < (p.length()); i++) {
    ret = ret * 2 + (p[i] - '0');
  }
  return ret;
}
void get_hs(string &str, int p) {
  for (int k = (1); k < (MAXK); k++) {
    for (int i = 0; i + k <= str.length(); i++) {
      int t = get_int(str.substr(i, k));
      hs[p][k].insert(t);
    }
  }
}
int main() {
  cin >> n;
  for (int i = (1); i < (n + 1); i++) {
    cin >> l[i];
    get_hs(l[i], i);
    if (l[i].length() > MAXK)
      r[i] = l[i].substr(l[i].length() - MAXK, MAXK),
      l[i] = l[i].substr(0, MAXK);
    else
      r[i] = l[i];
  }
  cin >> m;
  for (int i = (1); i < (m + 1); i++) {
    cin >> a >> b;
    string s = r[a] + l[b];
    if (l[a].length() < MAXK) {
      if (s.length() >= MAXK)
        l[i + n] = s.substr(0, MAXK);
      else
        l[i + n] = s;
    } else
      l[i + n] = l[a];
    if (r[b].length() < MAXK) {
      if (s.length() >= MAXK)
        r[i + n] = s.substr(s.length() - MAXK, MAXK);
      else
        r[i + n] = s;
    } else
      r[i + n] = r[b];
    for (int j = (1); j < (MAXK); j++) {
      for (auto &x : hs[a][j]) {
        hs[i + n][j].insert(x);
      }
      for (auto &x : hs[b][j]) {
        hs[i + n][j].insert(x);
      }
    }
    get_hs(s, i + n);
    for (int j = (1); j < (MAXK); j++) {
      if (hs[i + n][j].size() < (1 << j)) {
        printf("%d\n", j - 1);
        break;
      }
    }
  }
  return 0;
}
