#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int n, m, cnt;
bool vis[N];
int lch[N], rch[N];
string a[N][2];
set<string> dic;
void dfs(int i, int k) {
  if (vis[i]) return;
  vis[i] = true;
  string s, t;
  if (!lch[i])
    s = a[i][0];
  else
    s = a[lch[i]][1] + a[rch[i]][0];
  for (int i = 0; i + k <= s.length(); i++) {
    t = s.substr(i, k);
    if (!dic.count(t)) {
      dic.insert(t);
      cnt++;
    }
  }
  if (lch[i]) dfs(lch[i], k);
  if (rch[i]) dfs(rch[i], k);
}
bool check(int k, int i) {
  memset(vis, false, sizeof(vis));
  dic.clear();
  cnt = 0;
  dfs(i, k);
  return cnt == (1 << k);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    cin >> a[i][0];
    a[i][1] = a[i][0];
    lch[i] = rch[i] = 0;
  }
  scanf("%d", &m);
  for (int i = n + 1; i <= n + m; i++) {
    scanf("%d%d", lch + i, rch + i);
    a[i][0] = a[lch[i]][0];
    if (a[i][0].length() < 100) a[i][0] = a[i][0] + a[rch[i]][0];
    if (a[i][0].length() > 100) a[i][0] = a[i][0].substr(0, 100);
    a[i][1] = a[rch[i]][1];
    if (a[i][1].length() < 100) a[i][1] = a[lch[i]][1] + a[i][1];
    if (a[i][1].length() > 100)
      a[i][1] = a[i][1].substr(a[i][1].length() - 100, 100);
    int l = 0, r = 100, mid;
    while (l < r) {
      mid = (l + r + 1) >> 1;
      if (check(mid, i))
        l = mid;
      else
        r = mid - 1;
    }
    printf("%d\n", l);
  }
}
