#include <bits/stdc++.h>
using namespace std;
const int PRE = 1e6 + 1, MAXN = 8e4;
const long long B[7] = {0, 4, 16, 82, 6724, 50626, PRE},
                M[6] = {0, 1, 2, 0, 3, 1};
bool mark[6];
int calc(long long x) {
  int r = sqrt((double)x) + 1e-9, l = ceil(sqrt(sqrt((double)x))) + 1e-9;
  memset(mark, 0, sizeof mark);
  for (int i = 0; i < 6; i++)
    if (l < B[i + 1] && r >= B[i]) mark[M[i]] = true;
  int c = 0;
  while (mark[c]) c++;
  return c;
}
int main() {
  ios::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);
  int n;
  cin >> n;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    long long a;
    cin >> a;
    if (a < PRE)
      ans ^= M[upper_bound(B, B + 6, a) - B - 1];
    else
      ans ^= calc(a);
  }
  if (ans)
    cout << "Furlo\n";
  else
    cout << "Rublo\n";
}
