#include <bits/stdc++.h>
using namespace std;
const int kN = 1000 * 1000 + 1;
const int kM = 5;
int sum[kN][kM];
int gr[kN];
long long Sqrt4(long long n) {
  long long l = 0, r = 10 * 1000;
  while (l < r) {
    long long m = (l + r) / 2;
    if (m * m * m * m < n)
      l = m + 1;
    else
      r = m;
  }
  return l;
}
long long Sqrt(long long n) {
  long long l = 0, r = 1000 * 1000 * 1000;
  while (l < r) {
    long long m = (l + r + 1) >> 1;
    if (m * m > n)
      r = m - 1;
    else
      l = m;
  }
  return l;
}
void PreCalc() {
  sum[1][0] = 1;
  gr[1] = 0;
  sum[2][0] = 2;
  gr[2] = 0;
  sum[3][0] = 3;
  gr[3] = 0;
  for (int n = 4; n < kN; ++n) {
    int l = Sqrt4(n), r = Sqrt(n);
    int cnt[kM];
    for (int i = 0; i < kM; ++i) {
      sum[n][i] = sum[n - 1][i];
      cnt[i] = sum[r][i] - sum[l - 1][i];
    }
    for (int i = 0; i < kM; ++i)
      if (cnt[i] == 0) {
        ++sum[n][i];
        gr[n] = i;
        break;
      }
  }
}
int Gr(long long n) {
  if (n < kN) return gr[n];
  int l = Sqrt4(n), r = Sqrt(n);
  int cnt[kM];
  for (int i = 0; i < kM; ++i) cnt[i] = sum[r][i] - sum[l - 1][i];
  for (int i = 0; i < kN; ++i)
    if (cnt[i] == 0) return i;
}
int main() {
  PreCalc();
  int n;
  cin >> n;
  int x = 0;
  for (int i = 0; i < n; ++i) {
    long long value;
    cin >> value;
    x ^= Gr(value);
  }
  cout << (x == 0 ? "Rublo" : "Furlo");
  return 0;
}
