Non-Consecutive Props Arrangement

You are given a set of props numbered from 1 to n. Your task is to determine whether it is possible to arrange these props such that no two consecutive props (in the arrangement) have consecutive numbers.

In other words, find an arrangement of the numbers 1, 2, ..., n for which no two adjacent numbers satisfy |a - b| = 1.

Hint: It turns out that an arrangement is possible if and only if n is odd. Mathematically, the condition can be written as:

\( n \bmod 2 = 1 \)

Print "POSSIBLE" if such an arrangement exists, otherwise print "IMPOSSIBLE".

inputFormat

The input is read from stdin and has the following format:

T
n1
n2
...
nT

Here, T is the number of test cases. For each test case, a single integer n is given representing the number of props.

outputFormat

For each test case, output a single line to stdout containing either "POSSIBLE" if an arrangement exists or "IMPOSSIBLE" otherwise.

## sample

3
1
2
3

POSSIBLE
IMPOSSIBLE
POSSIBLE

</p>