N. Name of the Marathon?
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Everyone knows that the hardest part of organizing a programming marathon is choosing a name. You and your MarathonFriends are organizing a mini programming marathon and are discussing which name to choose!

After much thought, you are torn between two names: Cataratas do Pinhão and Pinhão das Cataratas. Obviously, a vote will be held to decide the winning name. Each MarathonFriend will write 1 (Cataratas do Pinhão) or 2 (Pinhão das Cataratas) on a piece of paper.

There will be many votes, so many votes that you will need many hands to count them! Unfortunately, you only have two hands =c. That is why you decide to write a program that counts all the votes and decides the winning name.

Input

The first line of input contains an integer $$$N$$$ ($$$11 \leq N \leq 10^{5}$$$), the number of votes received.

The second line of input contains $$$N$$$ numbers $$$a_1, a_2, \ldots, a_N$$$, the vote of the $$$i$$$-th MaratonAmigo.

Output

Output the winning name. In case of a tie, print "Cascatiba?"

Examples
Input
12
1 1 1 1 1 1 2 2 2 2 2 2
Output
Cascatiba?
Input
12
1 1 1 1 1 1 1 2 2 2 2 2
Output
Cataratas do Pinhao
Input
12
1 1 1 1 1 2 2 2 2 2 2 2
Output
Pinhao das Cataratas