#include <bits/stdc++.h>
using namespace std;
const int offset = 1 << 20;
int n;
long long a[100005];
int merge(int first, int second, int l) {
  if (l == 2) {
    if (first)
      return 1 + !!second;
    else
      return !!first;
  }
  if (first == l / 2)
    return first + second;
  else
    return first;
}
int T[2 * offset];
void add(int id, int lo, int hi, int p, int v) {
  if (lo > p || hi < p) return;
  if (lo == hi) {
    T[id] += v;
    return;
  }
  int mid = (lo + hi) / 2;
  add(id * 2, lo, mid, p, v);
  add(id * 2 + 1, mid + 1, hi, p, v);
  T[id] = merge(T[id * 2], T[id * 2 + 1], hi - lo + 1);
}
int pret[1000005];
int f(long long first) {
  static long long lo = 2, hi = 1;
  while ((hi + 1) * (hi + 1) <= first) ++hi, add(1, 0, offset - 1, pret[hi], 1);
  while (lo * lo * lo * lo < first) add(1, 0, offset - 1, pret[lo], -1), ++lo;
  return T[1];
}
int main() {
  ios_base::sync_with_stdio(false);
  pret[0] = pret[1] = pret[2] = pret[3] = 0;
  int lo = 2, hi = 1;
  for (int i = (int)(4); i < (int)(1000000); ++i) {
    while ((hi + 1) * (hi + 1) <= i) ++hi, add(1, 0, offset - 1, pret[hi], 1);
    while (lo * lo * lo * lo < i) add(1, 0, offset - 1, pret[lo], -1), ++lo;
    pret[i] = T[1];
  }
  memset(T, 0, sizeof T);
  cin >> n;
  long long r = 0;
  for (int i = (int)(0); i < (int)(n); ++i) cin >> a[i];
  sort(a, a + n);
  for (int i = (int)(0); i < (int)(n); ++i) {
    long long first = a[i];
    if (first < 1000000)
      r ^= pret[first];
    else
      r ^= f(first);
  }
  if (r == 0)
    cout << "Rublo\n";
  else
    cout << "Furlo\n";
  return 0;
}
