# Who Is the Champion?

DIU Take-Off Programming...
Limits 1s, 256 MB

The ICPC traces its roots to 1970 when the first competition was hosted by pioneers of the Alpha Chapter of the UPE Computer Science Honor Society.

The International Collegiate Programming Contest (ICPC) is the premier global programming competition conducted by and for the world’s universities. Teams of three, representing their university, work to solve the most real-world problems, fostering collaboration, creativity, innovation, and the ability to perform under pressure. Through training and competition, teams challenge each other to raise the bar on the possible. It is the oldest, largest, and most prestigious programming contest in the world.

The 45th Annual ICPC World Finals is held in Dhaka, Bangladesh, hosted by the University of Asia Pacific, and organized by the Government of Bangladesh (ICT Division and Bangladesh Computer Council) for the world's future IT leaders, researchers, software engineers, and inventors. World Finals participants are committed to advancing the art of computer science by using their skills in problem-solving to solve complex algorithmic problems. It's a great honor for us to see them competing so closely.

Alice and some of her friends are volunteers in the ICPC World Finals. Alice is so busy distributing food among contestants. One of her friends asked- What do you think, who will be the champion?

You can see the scoreboard till now and guess. There are two teams where the $1^{st}$ team solves $N$ problems and the $2^{nd}$ team solves $M$ problems. The team which solves the maximum number of problems will be the $\texttt{Champion}$ and the other one will be $\texttt{Runner up}$. As Alice is weak in logical thinking. So, she asks your help to write a program that will determine the champion and runner up team.

## Input

The first line of input contains an integer $N$ — denoting the number of solved problems of the $1^{st}$ team.

The second line of input contains an integer $M$ — denoting the number of solved problems of the $2^{nd}$ team.

$1<=N,M<=11$

$N$ and $M$ are not equal.

## Output

You have to output $\texttt{Champion}’’$ or $\texttt{Runner up}”$ (without the quotes) for each team according to the number of solved problems. See the samples for a better understanding.

## Samples

InputOutput
6
7

Runner up
Champion

InputOutput
10
9

Champion
Runner up