Rating changes for the last round are temporarily rolled back. They will be returned soon.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Furlo and Rublo and Game

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputFurlo and Rublo play a game. The table has *n* piles of coins lying on it, the *i*-th pile has *a*_{i} coins. Furlo and Rublo move in turns, Furlo moves first. In one move you are allowed to:

- choose some pile, let's denote the current number of coins in it as
*x*; - choose some integer
*y*(0 ≤*y*<*x*;*x*^{1 / 4}≤*y*≤*x*^{1 / 2}) and decrease the number of coins in this pile to*y*. In other words, after the described move the pile will have*y*coins left.

The player who can't make a move, loses.

Your task is to find out, who wins in the given game if both Furlo and Rublo play optimally well.

Input

The first line contains integer *n* (1 ≤ *n* ≤ 77777) — the number of piles. The next line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ 777777777777) — the sizes of piles. The numbers are separated by single spaces.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

Output

If both players play optimally well and Furlo wins, print "Furlo", otherwise print "Rublo". Print the answers without the quotes.

Examples

Input

1

1

Output

Rublo

Input

2

1 2

Output

Rublo

Input

10

1 2 3 4 5 6 7 8 9 10

Output

Furlo

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/28/2020 18:44:39 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|