#include <bits/stdc++.h>
using namespace std;
map<long long int, int> dp;
long long int arr[20] = {0, 4, 16, 82, 6724, 50626, 10000000};
long long int ttt[20] = {0, 1, 2, 0, 3, 1};
bool icer(long long int a, long long int b, long long int c, long long int d) {
  return b >= c and d >= a;
}
long long int bul(long long int x) {
  if (dp.find(x) != dp.end()) return dp[x];
  if (x < 4) return dp[x] = 0;
  if (x < 16) return dp[x] = 1;
  if (x < 82) return dp[x] = 2;
  if (x < 6724) return dp[x] = 0;
  if (x < 50626) return dp[x] = 3;
  if (x <= 10000000) return dp[x] = 1;
  set<long long int> S;
  long long int t = ceil(pow(x, 0.25)), k = floor(pow(x, 0.5));
  for (int i = 0; i <= 5; i++) {
    if (icer(t, k, arr[i], arr[i + 1] - 1)) S.insert(ttt[i]);
  }
  long long int ind = 0;
  while (S.find(ind) != S.end()) ind++;
  return dp[x] = ind;
}
int main() {
  long long int n, x, XOR = 0;
  cin >> n;
  while (n--) {
    cin >> x;
    XOR ^= bul(x);
  }
  if (XOR)
    puts("Furlo");
  else
    puts("Rublo");
}
