#include <bits/stdc++.h>
#pragma optimize("TKACHENKO-GORYACHENKO")
#pragma GCC optimize("O3")
using namespace std;
const long long maxn = 1e6;
long long n, m, k;
long long A[maxn];
long long D[maxn];
long long C[maxn];
vector<pair<long long, long long> > L;
vector<pair<long long, long long> > R;
vector<pair<long long, long long> > B;
vector<long long> Q;
vector<long long> QQ;
long long mex = 0;
void add(long long x) {
  C[x]++;
  while (C[mex] != 0) {
    mex++;
  }
}
void del(long long x) {
  C[x]--;
  if (mex > x && C[x] == 0) {
    mex = x;
  }
}
int main() {
  long long q, w, e, a, b, c;
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  for (q = 0; q < n; q++) {
    cin >> A[q];
    B.push_back(make_pair(A[q], q));
  }
  for (q = 0; q < maxn; q++) {
    Q.push_back(q * q);
    if (q <= 1e4) {
      QQ.push_back(q * q * q * q);
    }
  }
  for (q = 0; q < n; q++) {
    if (A[q] == 1) {
      continue;
    }
    L.push_back(
        make_pair(lower_bound(QQ.begin(), QQ.end(), A[q]) - QQ.begin(), q));
    R.push_back(
        make_pair(upper_bound(Q.begin(), Q.end(), A[q]) - Q.begin() - 1, q));
  }
  long long l = 1, r = 0;
  for (q = 2; q < maxn; q++) {
    while ((r + 1) * (r + 1) <= q) {
      r++;
      add(D[r]);
    }
    while (l * l * l * l <= q) {
      del(D[l]);
      l++;
    }
    D[q] = mex;
  }
  sort(L.begin(), L.end());
  sort(R.begin(), R.end());
  mex = 0;
  for (q = 0; q < maxn; q++) {
    C[q] = 0;
  }
  long long ans = 0;
  l = 1, r = 0;
  for (q = 0; q < L.size(); q++) {
    while (r < R[q].first) {
      r++;
      add(D[r]);
    }
    while (l < L[q].first) {
      del(D[l]);
      l++;
    }
    ans = ans ^ mex;
  }
  if (ans == 0) {
    cout << "Rublo";
  } else {
    cout << "Furlo";
  }
  return 0;
}
