#include <bits/stdc++.h>
using namespace std;
inline void wait(double seconds) {
  double endtime = clock() + (seconds * CLOCKS_PER_SEC);
  while (clock() < endtime) {
    ;
  }
}
template <class T>
inline T fastIn() {
  register char c = 0;
  register T a = 0;
  bool neg = false;
  while (c < 33) c = getchar();
  while (c > 33) {
    if (c == '-') {
      neg = true;
    } else {
      a = (a * 10) + (c - '0');
    }
    c = getchar();
  }
  return neg ? -a : a;
}
unordered_map<long long, long long> grundy;
inline int calc_grundy(long long num) {
  if (grundy.count(num) > 0) return grundy[num];
  long long from = (long long)(pow((double)num, 0.25));
  long long to = (long long)(pow((double)num, 0.50));
  while (from * from * from * from < num) ++from;
  while (to * to > num) --to;
  long long retval = 0;
  unordered_set<long long> mex;
  if (to < num && from <= to) {
    for (int i = from; i <= to; ++i) {
      if (grundy.count(i) > 0) {
        mex.insert(grundy[i]);
      } else {
        mex.insert(calc_grundy(i));
      }
    }
    for (int i = 0;; ++i) {
      if (mex.count(i) < 1) {
        retval = i;
        break;
      }
    }
  }
  grundy[num] = retval;
  return retval;
}
int csum[881917 + 10][5];
int gi[881917 + 10];
inline int grundy_fast(long long num) {
  long long from = (long long)(pow((double)num, 0.25));
  long long to = (long long)(pow((double)num, 0.50));
  while (from * from * from * from < num) ++from;
  while (to * to > num) --to;
  long long retval = 0;
  if (to < num && from <= to) {
    for (int i = 0; i < 5; ++i)
      if (csum[to][i] == csum[from - 1][i]) {
        retval = i;
        break;
      }
  }
  return retval;
}
inline void simulate() {
  memset(csum, 0, sizeof(csum));
  for (int i = 2; i <= 881918; ++i) {
    memcpy(csum[i], csum[i - 1], sizeof csum[i - 1]);
    gi[i] = grundy_fast(i);
    csum[i][gi[i]]++;
  }
}
const int MX = 77777 + 5;
long long num[MX];
int num_count;
inline void read() {
  num_count = fastIn<int>();
  for (int i = 0, j1 = num_count; i < j1; ++i) num[i] = fastIn<long long>();
}
inline void proc() {
  memset(csum, 0, sizeof(csum));
  for (int i = 2; i <= 881918; ++i) {
    memcpy(csum[i], csum[i - 1], sizeof csum[i - 1]);
    gi[i] = grundy_fast(i);
    csum[i][gi[i]]++;
  }
  int retval = 0LL;
  for (int i = 0, j1 = num_count; i < j1; ++i) retval ^= grundy_fast(num[i]);
  puts((retval ? "Furlo" : "Rublo"));
}
int main() {
  int kase = 1;
  for (int i = 1, j1 = kase + 1; i < j1; ++i) {
    read();
    proc();
  }
  return 0;
}
