PROGRAMMING:Keven's equation
$$Bear_ 2 $$humble to find $$Keven $$to help out, but $$Keven $$want to be happy at the top of the canyon do not want to work out. I threw it to $$bear_ 2 $$an equation $$a ^ n + B ^ n = C ^ n $$, if $$bear_ 2 $$can find a group of positive integer triples $$(a, B, c) $$to make the equation hold, and the triples $$(1 < = a < B < C < = 10000) $. So $$Keven $$will help him with the problem.
Can you help $$bear_ Do you know if Keven is perfunctory? Because not all equations have solutions, if the equation has no solution, output "impossible", otherwise output "keventxdy", without quotation marks.
###Input format:
Input the number of sample groups in the first line $$t (1 < = T < = 100)$$
After the T line, each line gives a positive integer $$n (1 < = n < = 100000)$$
###Output format:
For each group of data, output $$impossible $$in one line. If the equation has no solution, otherwise output $$Keven \ \ txdy$$
###Input example:
```in
two
one
six
```
###Output example:
```out
Keven txdy
Impossible
```
answer：If there is no answer, please comment
Can you help $$bear_ Do you know if Keven is perfunctory? Because not all equations have solutions, if the equation has no solution, output "impossible", otherwise output "keventxdy", without quotation marks.
###Input format:
Input the number of sample groups in the first line $$t (1 < = T < = 100)$$
After the T line, each line gives a positive integer $$n (1 < = n < = 100000)$$
###Output format:
For each group of data, output $$impossible $$in one line. If the equation has no solution, otherwise output $$Keven \ \ txdy$$
###Input example:
```in
two
one
six
```
###Output example:
```out
Keven txdy
Impossible
```
answer：If there is no answer, please comment