#include <bits/stdc++.h>
using namespace std;
const int M = 1000000, L = 10;
vector<int> gsum[L];
int SG(long long x) {
  if (!x) return 0;
  if (x == 1) return 0;
  long long l = floor(pow(x, 0.25));
  while (l < 0 || l * l * l * l < x) l++;
  long long r = ceil(pow(x, 0.5));
  while (r * r > x) r--;
  r++;
  for (int n_ = (L), i = 0; i < n_; ++i)
    if (r >= (int)gsum[i].size() || gsum[i][r] == gsum[i][l]) return i;
  assert(false);
  return 0;
}
int main(int argc, char *argv[]) {
  int n;
  cin >> n;
  vector<long long> a(n);
  for (int n_ = (n), i = 0; i < n_; ++i) cin >> a[i];
  for (int n_ = (L), i = 0; i < n_; ++i) gsum[i].push_back(0);
  for (int n_ = (M), i = 0; i < n_; ++i) {
    int g = SG(i);
    for (int n_ = (L), j = 0; j < n_; ++j) {
      gsum[j].push_back(gsum[j].back());
      if (j == g) gsum[j].back()++;
    }
  }
  int ans = 0;
  for (auto &ai : a) ans ^= SG(ai);
  if (ans)
    cout << "Furlo" << endl;
  else
    cout << "Rublo" << endl;
  return 0;
}
