h2. Date de intrare

The first line of the file $bytes.in$ contains $T$, the number of chests.
 
For each chest you are given a number $k$ representing the number of literals, and a string $s$ which represents the formula written on the chest.

Fişierul de intrare $bytes.in$ ...

h2. Date de ieşire

The output file $bytes.out$ will contain on $T$ lines the keys of the chests in the order they appear in the input.

În fişierul de ieşire $bytes.out$ ...

h2. Restricţii

* $1 ≤ T ≤ 15$
* $1 ≤ k ≤ 14$
* $1 ≤ |s| ≤ 10^5$
* For tests worth $20$ points, $1 ≤ k ≤ 10$
* For tests worth $30$ more points, there aren't any negated literals
* For tests worth another $20$ points, $1 ≤ k ≤ 12$
* The scores from the contest might be different than the scores you get here

* $... ≤ ... ≤ ...$

h2. Exemplu
table(example). |_. bytes.in |_. bytes.out |

| 3
4
@(c&d)^(!a&b&!c)^(b)@
4
@(!c)@
4
@(!c&!d)^(!a&c&!d)^(a&!b&c)@
| 6
8
8

| This is some
  text written on
  multiple lines.
| This is another
  text written on
  multiple lines.

|
h3. Explicaţie