#include <algorithm>
#include <bitset>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
const ll mod = 1e9 + 7;

const int N = 100010;
string s[N];

int main(void){
  int n;
  cin >> n;
  assert (n <= 100000);
  int tot_len = 0;
  REP(i, 0, n) {
    cin >> s[i];
    tot_len += s[i].length();
  }
  assert (tot_len <= 400000);
  int m;
  cin >> m;
  assert (m <= 100000);
  REP(loop_cnt, 0, m) {
    int i, j;
    cin >> i >> j;
    assert (1 <= i);
    assert (i < j);
    assert (j <= n);
    i--, j--;
    int pos = 0;
    int lim = min(s[i].length(), s[j].length());
    for (; pos < lim; ++pos) {
      if (s[i][pos] != s[j][pos]) break;
    }
    cout << pos << endl;
  }
}