#include <bits/stdc++.h>
using namespace std;
int grundy[5][1000100];
long long sqrto(long long n) {
  long long ret = sqrt(n);
  if (ret * ret > n)
    ret--;
  else
    ret++;
  if (ret * ret > n) ret--;
  return ret;
}
int makegrundy(long long n) {
  int i;
  long long st = sqrto(sqrto(n));
  if (st * st * st * st == n) st--;
  long long end = sqrto(n);
  if (end >= n) end--;
  for (i = 0;; i++)
    if (grundy[i][end] - grundy[i][st] <= 0) break;
  assert(i <= 4);
  if (n < 1000100) {
    for (int i = 0; i <= 4; i++) grundy[i][n] = grundy[i][n - 1];
    grundy[i][n]++;
  }
  return i;
}
int main() {
  int i;
  for (i = 1; i < 1000100; i++) makegrundy(i);
  int n;
  while (cin >> n) {
    int i;
    long long val;
    int ans = 0;
    for (i = 1; i <= n; i++) {
      cin >> val;
      ans ^= makegrundy(val);
    }
    if (ans > 0)
      cout << "Furlo" << endl;
    else
      cout << "Rublo" << endl;
  }
  return 0;
}
