#include <bits/stdc++.h>
using namespace std;
long long x, a[] = {3, 15, 81, 6723, 50625, 2562991875LL};
int sg[] = {0, 1, 2, 0, 3, 1, 2}, n, ans = 0;
int main() {
  set<int> s;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x;
    ans ^= sg[lower_bound(a, a + 6, x) - a];
  }
  if (!ans)
    cout << "Rublo" << endl;
  else
    cout << "Furlo" << endl;
}
