#include <bits/stdc++.h>
using namespace std;
vector<long long> f, g;
int main() {
  set<long long> s;
  f.push_back(1);
  g.push_back(0);
  s.insert(4);
  while (!s.empty()) {
    long long x = *s.begin();
    set<int> mex;
    long long lo = ceil(pow(x, 0.25));
    long long hi = floor(pow(x, 0.5));
    if (lo <= hi) {
      for (int i = 0; i < f.size(); i++) {
        long long flo = f[i],
                  fhi = (i + 1 == f.size()) ? 777777777777LL : (f[i + 1] - 1);
        if (fhi < lo || hi < flo) continue;
        mex.insert(g[i]);
      }
    }
    for (int m = 0;; m++) {
      if (mex.count(m) == 0) {
        f.push_back(x);
        g.push_back(m);
        break;
      }
    }
    if (x <= 881917) s.insert(x * x);
    if (x <= 940) s.insert((x - 1) * (x - 1) * (x - 1) * (x - 1) + 1);
    s.erase(s.begin());
  }
  int n;
  cin >> n;
  long long r = 0;
  for (int i = 0; i < n; i++) {
    long long a;
    cin >> a;
    long long x = 0;
    for (int j = 0; j < f.size(); j++) {
      if (f[j] <= a) x = g[j];
    }
    r ^= x;
  }
  if (r == 0)
    cout << "Rublo" << endl;
  else
    cout << "Furlo" << endl;
  return 0;
}
