#include <bits/stdc++.h>
using namespace std;
int n, ex[205][13][1 << 13], cnt[205][13], len[205];
char buf[205];
int rd[205];
int pref[205][13], suff[205][13];
int m;
int main() {
  scanf("%d", &n);
  for (int i = (0); i < (n); i++) {
    scanf("%s", buf);
    int m = strlen(buf);
    len[i] = m;
    for (int j = (0); j < (m); j++) rd[j] = buf[j] - '0';
    for (int j = (0); j < (m); j++) {
      int cur = 0;
      for (int ln = (1); ln < (13); ln++) {
        if (j + ln > m) continue;
        cur = 2 * cur + rd[j + ln - 1];
        ex[i][ln][cur] = 1;
        if (j == 0) pref[i][ln] = cur;
        if (j + ln == m) suff[i][ln] = cur;
      }
    }
  }
  scanf("%d", &m);
  for (int i = (0); i < (m); i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    a--;
    b--;
    int at = n + i;
    for (int l = (1); l < (13); l++)
      for (int j = (0); j < (1 << l); j++)
        ex[at][l][j] = (ex[a][l][j] | ex[b][l][j]);
    for (int sl = (1); sl < (min(13, len[a] + 1)); sl++)
      for (int pl = (1); pl < (min(13, len[b] + 1)); pl++) {
        if (sl + pl >= 13) continue;
        int val = suff[a][sl] * (1 << pl) + pref[b][pl];
        ex[at][pl + sl][val] = 1;
      }
    for (int l = (1); l < (min(13, len[a] + 1)); l++) pref[at][l] = pref[a][l];
    for (int l = (len[a] + 1); l < (min(13, len[a] + len[b] + 1)); l++) {
      pref[at][l] = pref[a][len[a]] * (1 << (l - len[a])) + pref[b][l - len[a]];
    }
    for (int l = (1); l < (min(13, len[b] + 1)); l++) suff[at][l] = suff[b][l];
    for (int l = (len[b] + 1); l < (min(13, len[a] + len[b] + 1)); l++) {
      suff[at][l] = suff[a][l - len[b]] * (1 << (len[b])) + suff[b][len[b]];
    }
    len[at] = min(13, len[a] + len[b]);
    for (int j = (1); j < (13); j++) {
      int g = 1;
      for (int k = (0); k < (1 << j); k++)
        if (!ex[at][j][k]) g = 0;
      if (!g) {
        printf("%d\n", j - 1);
        break;
      }
    }
  }
  return 0;
}
