Prime Cycle

### Read problem statements in [Russian](https://www.codechef.com/download/translated/LTIME94/russian/PRIMECYC.pdf) You are given a full binary tree of height $n$. Node $1$ is the root, and for $i \leq 2^{n-1}-1$, node $i$ is the parent of node $2i$ and node $2i+1$. For each node $i$, there is a positive integer $a_i$ written on it. A primeful cycle is a group of $k>2$ nodes $x_1,x_2,\ldots,