#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
const int N = 1000100;
int B[10][N];
void update(int r, int u) {
  for (; u < N; u += u & -u) B[r][u]++;
}
int calc(int r, int u) {
  int ans = 0;
  for (; u > 0; u -= u & -u) ans += B[r][u];
  return ans;
}
int gra[N], lft[N], rgt[N];
void pre() {
  for (int i = 1; i * i < N; i++) rgt[i * i] = i;
  for (int i = 1; i * i * i * i < N; i++) lft[i * i * i * i] = i;
  int pre = 1;
  for (int i = 2; i < N; i++) {
    if (rgt[i])
      pre = rgt[i];
    else
      rgt[i] = pre;
  }
  pre = 1;
  for (int i = 2; i < N; i++) {
    if (lft[i])
      pre = lft[i];
    else
      lft[i] = pre + 1;
  }
  update(0, 1);
  update(0, 2);
  update(0, 3);
  for (int i = 4; i < N; i++) {
    int R = rgt[i], L = lft[i];
    for (int j = 0;; j++)
      if (calc(j, R) == calc(j, L - 1)) {
        gra[i] = j;
        break;
      }
    update(gra[i], i);
  }
}
int grandy(long long n) {
  if (n < N) return gra[(int)n];
  int L = (int)sqrtl(sqrtl(n)), R = (int)sqrtl(n);
  while ((long long)L * L * L * L < n) L++;
  while ((long long)R * R <= n) R++;
  R--;
  for (int i = 0;; i++)
    if (calc(i, R) == calc(i, L - 1)) return i;
}
int main() {
  pre();
  int n;
  gn(n);
  int ans = 0;
  for (int i = 0; i < n; i++) {
    long long m;
    gn(m);
    ans ^= grandy(m);
  }
  if (ans)
    puts("Furlo");
  else
    puts("Rublo");
  return 0;
}
