Description

LRA is a admirer of Euler.

One day, LRA learns Euler functions $\varphi (n)$ .

LRA is so smart that he comes up with a simple question: What is the parity of $\varphi (n)$?

Tips： is the number of the positive number $x (1 \le x \le n)$and $gcd(x,n)=1$.

Format

Input

The first line is an integer $T(1\le T\le 10)$.

Followed by $T$ lines. Each line has an integer $n(1\le n\le 10^{100})$.

The input guarantees that $n$ contains no leading zeros.

Output

For each $n$, you need to ouput odd if $\varphi (n)$ is an odd, else output even.

Samples

2
1
3

odd
even

Hints

LRA can't solve it? It can't be true? It can't be true?

For example,$\varphi (10)=4$ , because $gcd(1,10)=1, gcd(3,10)=1, gcd(7,10)=1,gcd(9,10)=1$.