Problem Description

Takahashi has $ N $ tires and $ N $ pieces of wood at his home. He decided to combine them one by one to make $ N $ taiyaki (a Japanese pastry).

There is compatibility between tires and wood, and only a good combination of a tire and wood can make a delicious taiyaki. Takahashi only eats delicious taiyaki, so all $ N $ taiyaki he makes must be from good combinations of tires and wood.

Takahashi was curious about how many ways there are to make taiyaki that satisfy this condition, but he realized that it seems impossible to count them all.

Therefore, Takahashi decided to find out just the parity (even or odd) of the number of ways.

Takahashi has a table $ (S_{ij}) $ that represents whether each pair of tires and wood is compatible. This table consists of $ N $ rows and $ N $ columns, and the element at the $ i $-th row and $ j $-th column is $ 1 $ if the $ i $-th tire and the $ j $-th wood are compatible, and $ 0 $ if they are not. Please find the parity of the number of ways to combine all taiyaki deliciously on behalf of Takahashi. Note that two ways of combining are considered different if there exists a tire that is combined with a different piece of wood to make a taiyaki.

Input Format

The input is given from the standard input in the following format:

$ N $ $ S_{11}S_{12}..S_{1N} $ $ : $ $ S_{N1}S_{N2}..S_{NN} $

Output Format

Output "Even" if the number of ways to make all taiyaki deliciously is even, and "Odd" if it is odd.

Do not forget to add a newline at the end of the output.

Sample Input and Output

Sample Input #1

3
110
101
011

Sample Output #1

Even

Sample Input #2

3
110
111
011

Sample Output #2

Odd

Sample Input #3

2
00
00

Sample Output #3

Even

Sample Input #4

12
000000100000
011111111111
000000100000
000111111100
100100000100
100111111100
100100000100
100111111100
100100000100
100111111100
100000000000
111111111111

Sample Output #4

Even

Notes/Hints

Constraints

• $1\ ≦\ N\ ≦\ 200$
• $ S_{ij}=0 $ or $S_{ij}=1\ (1\ ≦\ i,j\ ≦\ N)$

Sample Explanation 1

There are $ 2 $ ways to combine them.

Sample Explanation 2

There are $ 3 $ ways to combine them.

Sample Explanation 3

There are $ 0 $ ways to combine them.

见题面 Input 部分

见题面 Output 部分