I. Intense Duel
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Samuell and Lleumas are competing to see who can pick the most coconuts. They take turns climbing the coconut tree to pick the coconuts. First, Samuell climbed and picked $$$x$$$ coconuts. Then Lleumas climbed and picked $$$y$$$ coconuts. From there, the duel intensified. Samuell decided that he would always pick the same number of coconuts that he picked on his last climb, plus the number that Lleumas picked the last time he climbed. Likewise, Lleumas decided to always pick the same number of coconuts that he picked on his last climb, plus the number that Samuell picked the last time he climbed.

Considering the strategies adopted, in the $$$n$$$-th climb, which competitor climbed the coconut tree and with how many coconuts did he climb down modulo $$$10^9+7$$$?

Input

The input consists of two lines:

The first contains an integer $$$n$$$ $$$(1 \le n \le 10^{18})$$$ - the $$$n$$$-th climb.

The second contains two integers $$$x$$$ and $$$y$$$ $$$(0 \le x,y \le 10^6)$$$ - the number of initial coconuts that Samuell and Lleumas picked, respectively.

Output

The output must have two lines:

The first must contain a string with the name of the person who climbed the $$$n$$$-th climb.

The second must contain an integer with the number of coconuts picked up in the $$$n$$$-th climb modulo $$$10^9+7$$$.

Examples
Input
3
2 5
Output
Samuell
7
Input
2
3 0
Output
Lleumas
0