plz explain me how to solve this…

BMEENA and BKUL are playing a game. There is a pile of N coins . BMEENA and BKUL make their moves alternately , BMEENA starts first . In first move BMEENA takes s coins such that 0 < s < N , from then on a player takes any number of coins which is a divisior of number of coins taken in previous move. One who makes the last move is winner . Find out who is the winner, assuming they both play optimally?

Input

First line contains the number of testcases T. Then each of next T lines contains an integer N.

Output

For each testcase output a line containing “BMEENA” or “BKUL” ( quotes are for clarity ) accordingly who is the winner.

Constraints

1 <= T <= 10

2 <= N <= 1,000,000

Example

Input:

1

5

Output:

BMEENA