#include <bits/stdc++.h>
using namespace std;
int n;
int s[1000000][10];
int grandy(long long num) {
  int l, r;
  if (num == 1) return 0;
  l = ceil(sqrt(sqrt((double)num)));
  r = floor(sqrt((double)num));
  if (l > r) return 0;
  for (int i = 0; i < 10; i++) {
    if (s[l - 1][i] == s[r][i]) return i;
  }
  return -1;
}
int ans;
int main() {
  s[1][0] = 1;
  for (int i = 2; i < 1000000; i++) {
    int temp = grandy(i);
    for (int j = 0; j < 10; j++) {
      s[i][j] = s[i - 1][j];
    }
    s[i][temp]++;
  }
  cin >> n;
  for (int i = 0; i < n; i++) {
    long long size;
    cin >> size;
    ans ^= grandy(size);
  }
  cout << (ans ? "Furlo" : "Rublo");
  return 0;
}
