#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
const long long ooo = 9223372036854775807ll;
const int _cnt = 1000 * 1000 + 7;
const int _p = 1000 * 1000 * 1000 + 7;
const int N = 200105;
const double PI = acos(-1.0);
const double eps = 1e-6;
int o(int x) { return x % _p; }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
void file_put() {
  freopen("filename.in", "r", stdin);
  freopen("filename.out", "w", stdout);
}
string s[205], tt;
int n, m, ans[205], l, r, len;
int work() {
  for (int l = (1); l <= (10); ++l)
    for (int t = (0); t <= ((1 << l) - 1); ++t) {
      tt = "";
      for (int k = (0); k <= (l - 1); ++k) tt += (t >> k & 1 ? "1" : "0");
      if (s[n].find(tt) == -1) return l - 1;
    }
}
int main() {
  scanf("%d", &n);
  for (int i = (1); i <= (n); ++i) cin >> s[i];
  scanf("%d", &m);
  while (m--) {
    scanf("%d%d", &l, &r);
    s[++n] = s[l] + s[r];
    len = s[n].length();
    if (len > 1000) s[n] = s[n].substr(0, 500) + s[n].substr(len - 500, 500);
    ans[n] = max(work(), max(ans[l], ans[r]));
    printf("%d\n", ans[n]);
  }
  return 0;
}
