B. Game
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Eric is playing a game with Cire.

The game is played over a sequence of length n. Eric takes the first turn, and the two players alternate actions. On each turn, a player can do one of the following two actions:

  • Delete the smallest number in the sequence (or any number if there are more than one).
  • Reduce all the numbers in the sequence by 1. This action assumes that all the numbers in the sequence are greater than 0.

If the sequence is empty after a person's operation, he wins the game.

Now you are given a sequence and you need to determine who will win the game.

Input

The first line contains an integer $$$n(1\le n \le 10^6)$$$.

The second line contains $$$n$$$ integers $$$a_1,a_2,\cdots,a_n(0\le a_i \le 10^{18})$$$, which denote the sequence.

Output

If Eric will win the game, output "Eric". otherwise, output "Cire".

Examples
Input
1
14514
Output
Eric
Input
7
1 9 1 9 8 1 0
Output
Cire