A. Jellyfish Can't Swim in the Night
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
"You know, jellyfish can't swim or shine on their own, but once they absorb the light around them, they're able to shine for themselves! So maybe... I can, too!"
Mahiru Kouzuki

A jellyfish lives on a $$$1$$$-dimensional coordinate system (i.e. a number line). It starts at point $$$0$$$, and wants to swim to point $$$n$$$, where $$$n$$$ is some multiple of $$$12$$$. Unfortunately, jellyfish can't swim in the night. In each day, with $$$12$$$ hours of sunlight, the jellyfish will swim $$$1$$$ point forward each hour. However, when night comes, for another $$$12$$$ hours, it will let itself drift in the current, each hour moving either $$$1$$$ point forward, $$$1$$$ point backward, or not moving at all. All three possibilities occur with equal probability (that is, each possible move occurs with probability $$$\frac{1}{3}$$$). The jellyfish would like to know what the expected number of days are before it reaches its destination. Alas, as it is a jellyfish, it does not know how expected value works. Please help it!

Input

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 100$$$). The description of the test cases follows.

The first and only line of each test case contains a single integer, $$$n$$$ ($$$12 \le n \le 1200$$$). Note that $$$n$$$ is guaranteed to be a multiple of $$$12$$$.

Output

For each test case, print a single integer denoting the expected number of days before the jellyfish reaches its destination.

Example
Input
2
12
24
Output
1
2