beecrowd | 1829

Biggest Number Game

Por Edson Alves, Faculdade UnB Gama BR Brazil

Timelimit: 3

Lucas and Pedro are high school friends. They were really impressed after a math class that introduced factorial numbers:

where n is a natural number and 0! = 1. They have a question: what is the operation that produces the biggest number, factorial or exponential?

Trying to find out the answer, both proposed the Biggest Number Game. In this game, two players call, at same time, as fast as they can, an operation that results in a big number. The player that calls the operation that results in the biggest number is the winner. Beto, friend of both, was the judge: he wrote down the operations. Lucas only called exponentials and Pedro only called factorials.

At the end of game, none of the three friends could tell who was the winner. Write a program that helps them to decide who won each round and who was the champion (the player that won most rounds).

Input

The first line contains an integer N (N ≤ 1.000), indicating the number of rounds played.

Each round is described by two lines: the first contains Lucas's exponential, in the form a^b (2 ≤ a, b ≤ 10.000); the second contains Pedro's factorial, in the form n! (2 ≤ n ≤ 10.000). The numbers a, b, n are integers and the expression a^b means "a raised to the b-th power".

Output

The first line of the output must be the message "Campeao: C!", where C is the champion, or the message "A competicao terminou empatada!", if the game was a tie.

After the initial message, for each round played must be printed the message "Rodada #r: V foi o vencedor", where r is the round number (the couting starts on one) and V is the winner of the round r.

Any printed message must be followed by a newline character.

Input Samples Output Samples

4

99^99

100!

57^199

874!

123^488

123!

7601^5684

7449!

A competicao terminou empatada!

Rodada #1: Lucas foi o vencedor

Rodada #2: Pedro foi o vencedor

Rodada #3: Lucas foi o vencedor

Rodada #4: Pedro foi o vencedor