#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N = 233;
int n, m;
struct str {
  static const int K = 10;
  static const int SIZE = 1 << K + 1;
  string pre, suf;
  bitset<SIZE> b;
  void adjust() {
    if (((int)(pre).size()) > K) pre = pre.substr(0, K);
    if (((int)(suf).size()) > K) suf = suf.substr(((int)(suf).size()) - K, K);
  }
} a[N];
str add(str a, str b) {
  str c;
  c.b = a.b | b.b;
  if (((int)(c.pre = a.pre).size()) < str::K) c.pre += b.pre;
  if (((int)(c.suf = b.suf).size()) < str::K) c.suf = a.suf + b.suf;
  c.adjust();
  string g = a.suf + b.pre;
  for (int i = 0, ed = ((int)(g).size()); i < ed; ++i) {
    int t = 0;
    for (int j = i, ed = ((int)(g).size()); j < ed; ++j) {
      t = t << 1 | (g[j] - '0');
      int tp = (1 << j - i + 1) | t;
      if (tp >= str::SIZE) break;
      c.b[tp] = 1;
    }
  }
  return c;
}
int solve(str a) {
  for (int i = str::K + 1 - 1, ed = 1; i >= ed; --i) {
    bool ok = 1;
    for (int j = 0, ed = 1 << i; j < ed; ++j) {
      if (!a.b[1 << i | j]) {
        ok = 0;
        break;
      }
    }
    if (ok) return i;
  }
  return 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 0, ed = n; i < ed; ++i) {
    string s;
    cin >> s;
    a[i].pre = a[i].suf = s;
    for (int j = 0, ed = ((int)(s).size()); j < ed; ++j) {
      int t = 0;
      for (int k = j, ed = ((int)(s).size()); k < ed; ++k) {
        t = t << 1 | (s[k] - '0');
        int tp = (1 << k - j + 1) | t;
        if (tp >= str::SIZE) break;
        a[i].b[tp] = 1;
      }
    }
  }
  cin >> m;
  for (int i = 0, ed = m; i < ed; ++i) {
    int j, k;
    cin >> j >> k;
    a[n] = add(a[j - 1], a[k - 1]);
    cout << solve(a[n++]) << endl;
  }
  return 0;
}
