#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1E-9;
const int INF = (int)1E9;
const long long INF64 = (long long)1E18;
const long double PI = 2 * acos(.0);
int G[1000000];
int limit_inf[50];
int limit_sup[50];
int value[50];
bool mapeo[10];
int ind = 0;
void find_G(long long ss) {
  limit_inf[ind] = 0;
  limit_sup[ind] = INF;
  value[ind] = 0;
  ind++;
  for (int start = 4; start < (int)(890000); start++) {
    double mini = sqrt(sqrt(start * 1.0));
    double maxi = sqrt(start * 1.0);
    int lower_ = ceil(mini);
    int upper_ = floor(maxi);
    fill(mapeo, mapeo + 10, false);
    for (int i = 0; i < ind; i++) {
      if (limit_inf[i] <= upper_ && limit_sup[i] >= lower_)
        mapeo[value[i]] = true;
    }
    int chosen = -1;
    for (int i = 0; i < (int)(10); i++) {
      if (mapeo[i] == false) {
        chosen = i;
        break;
      }
    }
    if (chosen != G[start - 1]) {
      limit_inf[ind] = start;
      limit_sup[ind - 1] = start - 1;
      limit_sup[ind] = INF;
      value[ind] = chosen;
      ind++;
    }
    G[start] = chosen;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  G[0] = G[1] = G[2] = G[3] = 0;
  int n;
  cin >> n;
  find_G(10);
  int winner = 0;
  long long values;
  string answer[] = {"Furlo", "Rublo"};
  for (int k = 0; k < (int)(n); k++) {
    cin >> values;
    int chosen = -1;
    if (values < 888000)
      chosen = G[values];
    else {
      double mini = sqrt(sqrt(values * 1.0));
      double maxi = sqrt(values * 1.0);
      int lower_ = ceil(mini);
      int upper_ = floor(maxi);
      fill(mapeo, mapeo + 10, false);
      for (int i = 0; i < ind; i++) {
        if (limit_inf[i] <= upper_ && limit_sup[i] >= lower_)
          mapeo[value[i]] = true;
      }
      for (int i = 0; i < (int)(10); i++) {
        if (mapeo[i] == false) {
          chosen = i;
          break;
        }
      }
    }
    winner ^= chosen;
  }
  cout << answer[winner == 0] << endl;
  return 0;
}
