Furlo and Rublo play a game. The table has n piles of coins lying on it, the i-th pile has ai 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; x1 / 4 ≤ y ≤ x1 / 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 a1, a2, ..., an (1 ≤ ai ≤ 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
#include <bits/stdc++.h>
using namespace std;
int get_nim(long long x) {
  if (x < 4) return 0;
  if (x < 16) return 1;
  if (x < 82) return 2;
  if (x < 6724) return 0;
  if (x < 50626) return 3;
  if (x < 2562991876LL) return 1;
  return 2;
}
int main() {
  int n, ans = 0;
  long long a;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> a;
    ans ^= get_nim(a);
  }
  if (ans)
    cout << "Furlo" << endl;
  else
    cout << "Rublo" << endl;
  return 0;
}
