E. Another Game
time limit per test
1 second
memory limit per test
512 megabytes
input
standard input
output
standard output

Charlie and Dan play a game on $$$N$$$ piles numbered from $$$1$$$ to $$$N$$$ from left to right. Each pile contains a strictly positive number of stones.

The rules are simple:

  • The players take turns. Charlie is first.
  • Both players play optimally.
  • At a turn, a player takes a strictly positive number of stones from the leftmost non-empty pile and moves them to the neighbouring right pile.
  • A player will lose if, at the player's turn, the only non-empty pile is pile number $$$N$$$.

Who wins the game?

Input

The first line of input will contain an integer $$$N$$$ ($$$2\leq N \leq 10^3$$$), the number of piles.

The next line contains $$$N$$$ integers $$$v_1, v_2, ... , v_n$$$ ($$$1\leq v_i \leq 10^9$$$).

Output

The output should contain the name of the winner of the game: "Charlie" or "Dan".

Example
Input
3
2 2 2
Output
Charlie