Huge Strings

2000ms

262144K

Description:

You are given n strings s₁, s₂, ..., s_n consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operation the concatenation s_{a_i}s_{b_i} is saved into a new string s_n + i (the operations are numbered starting from 1). After each operation you need to find the maximum positive integer k such that all possible strings consisting of 0 and 1 of length k (there are 2^k such strings) are substrings of the new string. If there is no such k, print 0.

Input:

The first line contains single integer n (1 ≤ n ≤ 100) — the number of strings. The next n lines contain strings s₁, s₂, ..., s_n (1 ≤ |s_i| ≤ 100), one per line. The total length of strings is not greater than 100.

The next line contains single integer m (1 ≤ m ≤ 100) — the number of operations. m lines follow, each of them contains two integers a_i abd b_i (1 ≤ a_i, b_i ≤ n + i - 1) — the number of strings that are concatenated to form s_n + i.

Output:

Print m lines, each should contain one integer — the answer to the question after the corresponding operation.

Sample Input:

Sample Output:

1
2
0

Note:

On the first operation, a new string "0110" is created. For k = 1 the two possible binary strings of length k are "0" and "1", they are substrings of the new string. For k = 2 and greater there exist strings of length k that do not appear in this string (for k = 2 such string is "00"). So the answer is 1.

On the second operation the string "01100" is created. Now all strings of length k = 2 are present.

On the third operation the string "1111111111" is created. There is no zero, so the answer is 0.

Informação

Provedor Codeforces

Código CF868D