#include <bits/stdc++.h>
using namespace std;
int bo[5];
long long find_least(long long l, long long r) {
  memset(bo, 0, sizeof(bo));
  if (l <= 0) bo[1] = true;
  if (l < 4 && r > 0) bo[0] = true;
  if (l < 16 && r >= 4) bo[1] = true;
  if (l < 82 && r >= 16) bo[2] = true;
  if (l < 6724 && r >= 82) bo[0] = true;
  if (l < 50626 && r >= 6724) bo[3] = true;
  if (r >= 50626) bo[1] = true;
  for (long long i = 0; i < 5; i++)
    if (!bo[i]) return i;
  return -1;
}
int main() {
  long long ans, n, m;
  while (cin >> n) {
    ans = 0;
    for (int i = 0; i < n; i++) {
      cin >> m;
      if (m == 1) continue;
      long long l, r;
      for (l = (long long)sqrt(sqrt(m)) - 1;; l++)
        if (l >= 0 && l * l * l * l >= m) break;
      for (r = (long long)sqrt(m) + 1;; r--)
        if (r >= 0 && r * r <= m) break;
      if (l <= r) ans ^= find_least(l, r);
    }
    if (ans)
      cout << "Furlo" << endl;
    else
      cout << "Rublo" << endl;
  }
  return 0;
}
