#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:60000000")
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
double const pi = 3.1415926535897932384626433832795;
int const inf = (int)1e9;
long long const inf64 = (long long)4e18;
const string name = "c";
const int NMAX = 888888;
int ans, n, g[NMAX], cnt[NMAX], l, r, t[2100100];
long long ept[NMAX];
void update(int v, int l, int r, int p, int c) {
  if (l > p || r < p) return;
  if (l == r) {
    t[v] = c;
    return;
  }
  update(2 * v, l, (l + r) >> 1, p, c);
  update(2 * v + 1, (l + r + 2) >> 1, r, p, c);
  t[v] = t[2 * v] + t[2 * v + 1];
}
int get(int v, int l, int r) {
  if (l == r) return l;
  if (t[2 * v] < ((l + r) >> 1) - l + 1) return get(2 * v, l, (l + r) >> 1);
  return get(2 * v + 1, (l + r + 2) >> 1, r);
}
int calc(long long zn) {
  int ll = (int)(sqrt(sqrt(zn + 0.0)) - 0.000001) + 1;
  int rr = (int)(sqrt(zn + 0.0) + 0.000001);
  while (l < ll) {
    cnt[g[l]]--;
    if (cnt[g[l]] == 0) update(1, 0, NMAX - 1, g[l], 0);
    l++;
  }
  while (r < rr) {
    r++;
    cnt[g[r]]++;
    if (cnt[g[r]] == 1) update(1, 0, NMAX - 1, g[r], 1);
  }
  return get(1, 0, NMAX - 1);
}
int main() {
  for (int i = 1; i <= 3; ++i) g[i] = 0;
  memset(t, 0, sizeof(t));
  memset(cnt, 0, sizeof(cnt));
  l = 2, r = 1;
  for (int i = 4; i < NMAX; ++i) g[i] = calc(i);
  cerr << clock() << endl;
  cin >> n;
  for (int i = 0; i < (int)n; i++) scanf("%I64d", &ept[i]);
  sort(ept, ept + n);
  memset(t, 0, sizeof(t));
  memset(cnt, 0, sizeof(cnt));
  ans = 0, l = 2, r = 1;
  for (int i = 0; i < (int)n; i++) ans ^= calc(ept[i]);
  if (ans)
    cout << "Furlo" << endl;
  else
    cout << "Rublo" << endl;
  return 0;
}
