#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int X = 5;
int dp[N][X];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  for (int i = 2; i < N; i++) {
    int l = ceil(pow(i, 0.25));
    int r = sqrt(i);
    int ok = 0;
    for (int j = 0; j < X; j++) {
      if (dp[r][j] - dp[l - 1][j] == 0) {
        dp[i][j] = 1;
        ok = 1;
        break;
      }
    }
    assert(ok);
    for (int j = 0; j < X; j++) {
      dp[i][j] += dp[i - 1][j];
    }
  }
  int n;
  cin >> n;
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    long long a;
    cin >> a;
    if (a == 1) continue;
    int l = ceil(pow(a, 0.25));
    int r = sqrt(a);
    int ok = 0;
    for (int j = 0; j < X; j++) {
      if (dp[r][j] - dp[l - 1][j] == 0) {
        ans ^= j;
        ok = 1;
        break;
      }
    }
    assert(ok);
  }
  if (ans)
    cout << "Furlo\n";
  else
    cout << "Rublo\n";
  return 0;
}
