A11199 | Huge Strings

You are given $n$ strings $s_{1},s_{2},...,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_{ai}s_{bi}$ 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$ .

The first line contains single integer $n$ ( $1<=n<=100$ ) — the number of strings. The next $n$ lines contain strings $s_{1},s_{2},...,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}$ .

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