#include <bits/stdc++.h>
using namespace std;
long long const N = 1e5 + 20, MAX = 1e6 + 20;
long long n, a[N], res[N];
long long g[MAX], seg[MAX << 2];
void modify(long long p, long long val, long long v = 1, long long s = 0,
            long long e = MAX) {
  if (s + 1 == e) {
    seg[v] += val;
    return;
  }
  long long mid = (s + e) >> 1, lc = v << 1, rc = lc | 1;
  if (p < mid)
    modify(p, val, lc, s, mid);
  else
    modify(p, val, rc, mid, e);
  seg[v] = (seg[lc] > 0) && (seg[rc] > 0);
}
long long get(long long v = 1, long long s = 0, long long e = MAX) {
  if (s + 1 == e) return s;
  long long mid = (s + e) >> 1, lc = v << 1, rc = lc | 1;
  if (!seg[lc]) return get(lc, s, mid);
  return get(rc, mid, e);
}
void clr(long long v = 1, long long s = 0, long long e = MAX) {
  if (s + 1 == e) {
    seg[v] = 0;
    return;
  }
  long long mid = (s + e) >> 1, lc = v << 1, rc = lc | 1;
  clr(lc, s, mid);
  clr(rc, mid, e);
  seg[v] = 0;
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> a[i];
  g[1] = g[2] = g[3] = 0;
  long long p1 = 0, p2 = -1;
  for (long long i = 4; i < MAX; i++) {
    while ((p2 + 1) * (p2 + 1) <= i) {
      p2++;
      modify(g[p2], 1);
    }
    while (p1 * p1 * p1 * p1 < i) {
      modify(g[p1], -1);
      p1++;
    }
    g[i] = get();
  }
  clr();
  sort(a, a + n);
  p1 = 0, p2 = -1;
  for (long long i = 0; i < n; i++) {
    if (a[i] <= 3) {
      res[i] = 0;
      continue;
    }
    while ((p2 + 1) * (p2 + 1) <= a[i]) {
      p2++;
      modify(g[p2], 1);
    }
    while (p1 * p1 * p1 * p1 < a[i]) {
      modify(g[p1], -1);
      p1++;
    }
    res[i] = get();
  }
  long long ans = 0;
  for (long long i = 0; i < n; i++) ans ^= res[i];
  if (!ans) return cout << "Rublo\n", 0;
  cout << "Furlo\n";
}
