C. Basketball Tournament
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

A basketball tournament with no draws involved $$$n$$$ teams. Each game ended in a victory for one team. Arseny wrote down the number of wins for each team, but doesn't know what system the tournament was run under. He has two hypotheses:

  • Each team plays every other team exactly once. [-4ex]
  • A single-elimination tournament, where a team is eliminated after its first loss.

Help Arseny determine which system could have been used, based on the known number of wins for each team.

Input

The first line of the input file contains an integer $$$n$$$ ($$$3 \le n \le 10^{5}$$$) — the number of teams.

In each of the following $$$n$$$ lines, the name of the team and the number of victories are given.

It is guaranteed that the sum of the lengths of the team names is no greater than $$$3 \cdot 10^5$$$.

Output

Output Round-robin if the teams played in a round-robin tournament, otherwise output Olympic.

Scoring

The problem has 20 tests, each test is worth 5 points.

Examples
Input
3
aba 1
abc 2
rty 0
Output
Round-robin
Input
4
a 0
b 0
c 1
d 2
Output
Olympic