Kyungjae claims he can instantly tell whether any integer is odd or even. Changsik wants to test whether this ability is real, so he decides to check $N$ integers.
Given $N$ integers, write a program that determines whether each one is odd or even, and help verify Kyungjae's ability.
The first line contains the number of integers $N$ ($1 \le N \le 100$).
Each of the next $N$ lines contains one integer $K$ ($1 \le K \le 10^{60}$) whose parity must be determined.
For each integer $K$, print odd on its own line if $K$ is odd, or even if $K$ is even.
$1024$ is divisible by $2$, so it is even, while $5931$ is not, so it is odd.
Because $K$ can be as large as $10^{60}$, it may not fit in a standard fixed-width integer type. You only need to inspect the last digit to determine parity.