|Codeforces Round #156 (Div. 2)|
Furlo 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:
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.
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.
If both players play optimally well and Furlo wins, print "Furlo", otherwise print "Rublo". Print the answers without the quotes.
1 2 3 4 5 6 7 8 9 10