In a village named CodeVillage, there lived a farmer named Digo. Digo had a very greedy wife. She loved only costly things, that's why she loved prime numbers. She told Digo one day that she wanted to eat two prime numbers.
Now, Digo has enough money to buy only one prime number. But Digo is very skilled in farming and he remembers that if someone grows a plant with a seed of any number 'x', the plant always produces two fruits x1 and x2 such that x1+x2=x. Note that x1 and x2 are different.
So there is some chance, however small, that if he buys a prime number and raise a plant, he can fullfil the desire of his wife with the fruits of that plant.
Since he is a farmer and not a mathematician, he seeks your help to decide which number to buy, and note that Digo has firm belief in buying only the seed of a prime number.
1 is a prime number in CodeVillage.

Input:
First line contain t, number of testcases.
t lines follow, each having one integer x.

Output:
t lines, stating your response "BUY" or "DONT BUY".

Constraints:
t is less than 20.
Each 'x' is less than 1000000.

Sample Input:
3
4
7
17

Sample Output:
DONT BUY
BUY
DONT BUY

Explanation:
4 is not prime, so Digo will not buy it.
7 is prime and can give fruits 5 and 2 (though the probability is quite low), he can buy.
17 is prime but cant give any combination of fruits such that both of them turn out to be prime, so he will not buy.