K. Splitting Game
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

In the world of Westeros, two skilled knights, Rami and Yessine, were known for their strategic prowess and their love for games of wit and strategy. One day, they decided to test their skills against each other in the Splitting Game.

This game is a $$$2$$$ players turn-based game played on some array $$$A$$$ of size $$$n$$$, with each turn as follow:

  • A player must choose $$$A_k \gt 0$$$ and remove it from the array.
  • After removing $$$A_k$$$, the same player must create some array $$$B$$$ whose elements are all positive and strictly less than $$$A_k.$$$ Note that $$$B$$$ can be empty.
  • Finally, he will concatenate $$$B$$$ to $$$A$$$
Rami starts first, and a player loses if he cannot make a move.

Given the array $$$A,$$$ and assuming both players play optimal moves. Who will win?

Input
  • $$$0\le n \le 2\times 10^5$$$
  • $$$0\le A_1,\dots,A_n \le 10^{18}$$$
Output

A single line containing:

  • Rami if Rami will win.
  • Yessine otherwise.
The judge system is case sensitive so make sure that your output follows the format indicated above
Examples
Input
0
Output
Yessine
Input
5
1 1 1 1 1
Output
Rami
Input
3
1 2 2
Output
Rami
Note

It can be proven that no matter the strategy of each player, the game will always be finite.