#C3234. Exact Robot Weight Combination

    ID: 46639 Type: Default 1000ms 256MiB

Exact Robot Weight Combination

Exact Robot Weight Combination

In this problem, you are given two robot models with weights (a = 4) and (b = 6). Your task is to determine whether it is possible to achieve an exact target weight (W) by combining any number (including zero) of these robots. In mathematical terms, you need to decide if there exist non-negative integers (i) and (j) such that: [ 4i + 6j = W ] For each test case, print "POSSIBLE" if such a combination exists; otherwise, print "IMPOSSIBLE".

inputFormat

The input is read from standard input. The first line contains a single integer (T), denoting the number of test cases. Each of the following (T) lines contains one integer (W), the target weight.

outputFormat

For each test case, output a single line containing either "POSSIBLE" if it is possible to achieve the exact weight using the two robot models, or "IMPOSSIBLE" if it is not.## sample

3
8
10
13
POSSIBLE

POSSIBLE IMPOSSIBLE

</p>