#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long maxn = 881927;
vector<pair<long long, long long> > v[5];
long long square[maxn];
long long power(long long aa, long long bb) {
  if (pow(aa, bb) > 2e18) return 2e18;
  long long x = 1, y = aa;
  while (bb > 0) {
    if (bb % 2) {
      x = (x * y);
    }
    bb /= 2;
    if (bb > 0) y = (y * y);
  }
  return x;
}
long long nthroot(long long x, double y) {
  long long temp = pow(x, 1.0 / y);
  while (power(temp, y) < x) ++temp;
  return temp;
}
long long root(long long x) {
  long long a = sqrt(x);
  while (square[a + 1] <= x) a++;
  return a;
}
bool g(long long l1, long long r1, long long l2, long long r2) {
  if (r1 < l2 or r2 < l1) return 0;
  return 1;
}
long long f(long long x) {
  if (x <= 881918) {
    for (long long i = 0; i < 5; ++i) {
      for (auto it : v[i]) {
        if (g(it.first, it.second, x, x)) return i;
      }
    }
  }
  long long a = nthroot(x, 4);
  long long b = root(x);
  if (b == x) b--;
  if (a > b) return 0;
  for (long long i = 0; i < 5; ++i) {
    bool flag = 0;
    for (auto it : v[i]) {
      if (g(a, b, it.first, it.second)) flag = 1;
    }
    if (!flag) return i;
  }
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  for (long long i = 0; i < maxn; ++i) {
    square[i] = i * i;
  }
  v[0].emplace_back(1, 3);
  v[0].emplace_back(82, 6723);
  v[1].emplace_back(4, 15);
  v[1].emplace_back(50626, 881918);
  v[2].emplace_back(16, 81);
  v[3].emplace_back(6724, 50625);
  long long n;
  cin >> n;
  long long ans = 0;
  for (long long i = 0; i < n; ++i) {
    long long x;
    cin >> x;
    ans ^= f(x);
  }
  if (ans != 0) {
    cout << "Furlo" << '\n';
    ;
  } else
    cout << "Rublo" << '\n';
  ;
  return 0;
}
