#include <bits/stdc++.h>
using namespace std;
int Mex(vector<bool>& jest) {
  int x = 0;
  while (jest[x]) ++x;
  return x;
}
int x[] = {1, 4, 16, 82, 6724, 50626};
int y[] = {3, 15, 81, 6723, 50625, 1000000};
int z[] = {0, 1, 2, 0, 3, 1};
void preprocesuj() {
  vector<int> sg(1000001);
  sg[1] = sg[2] = sg[3] = 0;
  int l = 2, p = 2;
  for (int i = 4; i < 1000001; ++i) {
    while (l * l * l * l < i) ++l;
    while (p * p <= i) ++p;
    --p;
    vector<bool> jest(5, false);
    for (int j = l; j <= p; ++j) jest[sg[j]] = true;
    sg[i] = Mex(jest);
    if (sg[i] != sg[i - 1]) cout << i << " " << sg[i] << endl;
  }
}
long long Szukaj1(long long x) {
  long long l = 0, p = 1000, s, r = -1;
  while (l <= p) {
    s = (l + p) / 2;
    if (s * s * s * s >= x) {
      r = s;
      p = s - 1;
    } else
      l = s + 1;
  }
  return r;
}
long long Szukaj2(long long x) {
  long long l = 0, p = 1000000, s, r = -1;
  while (l <= p) {
    s = (l + p) / 2;
    if (s * s <= x) {
      r = s;
      l = s + 1;
    } else
      p = s - 1;
  }
  return r;
}
int main() {
  ios_base::sync_with_stdio(0);
  vector<vector<int> > pref(4, vector<int>(1000001, 0));
  for (int i = 0; i < 6; ++i)
    for (int j = x[i]; j <= y[i]; ++j) pref[z[i]][j] = 1;
  for (int i = 0; i < 4; ++i)
    for (int j = 1; j < 1000001; ++j) pref[i][j] += pref[i][j - 1];
  int n;
  cin >> n;
  int odp = 0;
  for (int i = 0; i < n; ++i) {
    long long a;
    cin >> a;
    if (a <= 1000000) {
      for (int j = 0; j < 6; ++j)
        if (a >= x[j] && a <= y[j]) odp ^= z[j];
    } else {
      long long l = Szukaj1(a);
      long long p = Szukaj2(a);
      vector<bool> jest(5, false);
      for (int j = 0; j < 3; ++j)
        if (pref[j][p] - pref[j][l - 1] >= 1) jest[j] = true;
      odp ^= Mex(jest);
    }
  }
  if (odp != 0)
    cout << "Furlo";
  else
    cout << "Rublo";
  return 0;
}
