#include <bits/stdc++.h>
using namespace std;
unordered_map<long long, int> dp(10000000 / 7);
long long solve(long long y) {
  assert(y > 0);
  if (dp.find(y) != dp.end()) {
    return dp[y];
  }
  long long x = floor(sqrt(y));
  long long z = ceil(sqrt(sqrt(y)));
  if (x == y) --x;
  if (y == z) ++z;
  int arr[5];
  memset(arr, 0, sizeof(arr));
  int d = 0;
  for (long long a = z; a <= x; a++) {
    if (a > 0) {
      int t = solve(a);
      if (!arr[t]) ++d, arr[t] = 1;
    }
    if (d >= 3 || 1LL * a - z >= 6) break;
  }
  for (long long a = x; a >= z; a--) {
    if (a > 0) {
      int t = solve(a);
      if (!arr[t]) ++d, arr[t] = 1;
    }
    if (d >= 3 || x - a >= 6) break;
  }
  int q = 0;
  while (arr[q]) {
    q++;
  }
  return dp[y] = q;
}
int main() {
  int n;
  cin >> n;
  int p = 0;
  for (int i = 0; i < n; ++i) {
    long long x;
    scanf("%lld", &x);
    p ^= solve(x);
  }
  if (!p)
    puts("Rublo");
  else
    puts("Furlo");
}
