Problem C
Borðspil
Languages
en
is
Arnar and Unnar recently bought a new board game. In the game Arnar gets $n$ pieces and Unnar gets $m$ pieces. You can place pieces in three different spots. Arnar starts by distributing all his piece on the spots and then Unnar does the same. For each spot if Unnar has more pieces on it he gets a point and if Arnar has more piece he gets a point. If there is a tie Arnar gets the point.
Who wins if both players play optimally?
Input
The only line of the input contains two integers $n$ and $m$ ($0 \leq n, m \leq 10^9$).
Output
Print the name of the winner if both play optimally.
Scoring
|
Group |
Points |
Constraints |
|
1 |
25 |
$0 \leq n,m \leq 3$ |
|
2 |
25 |
$0 \leq n,m \leq 100$ |
|
3 |
25 |
$0 \leq n,m \leq 4000$ |
|
4 |
25 |
No further constraints |
| Sample Input 1 | Sample Output 1 |
|---|---|
3 3 |
Arnar |
| Sample Input 2 | Sample Output 2 |
|---|---|
2 3 |
Unnar |
| Sample Input 3 | Sample Output 3 |
|---|---|
1 2 |
Unnar |
