Problem D
Traveling Salesman

Input

Each test case consists of a line containing $c$, the number of countries ($4\le c\le 6000$), followed by $c$ lines containing the integers $n{x}_1{y}_1{z}_1\dots x_n{y}_n{z}_n$, describing (in order) the $n$ corners of a closed polygon ($3\le n\le 20$). Then follows a line with one integer $m$ $(0<m\le 50)$, and then $m$ lines with queries $c_a{c}_b$, where $c_a$ and $c_b$ are country numbers (starting with 1). No point will be on the line between two connected points, and $-{10}^7\le x,y,z\le {10}^7$ for all points. No two non-adjacent edges of a country share a common point. The input is terminated by a case where $c=0$, which should not be processed.

Output

For each query, output the number of borders you must cross to go from $c_a$ to $c_b$.

6
4 0 0 0 0 0 1 0 1 1 0 1 0
4 1 0 0 1 0 1 1 1 1 1 1 0
4 0 0 0 1 0 0 1 0 1 0 0 1
4 0 1 0 1 1 0 1 1 1 0 1 1
4 0 0 0 0 1 0 1 1 0 1 0 0
4 0 0 1 0 1 1 1 1 1 1 0 1
2
1 2
1 3
0

2
1