#include <bits/stdc++.h>
using namespace std;
int sg[10000000];
vector<int> a;
long long int vals[] = {1, 4, 16, 82, 6724, 50626, 2562991876LL};
long long int vv[] = {0, 1, 2, 0, 3, 1, 2};
inline int grundy(long long int n) {
  if (n < 4)
    return 0;
  else if (n < 16)
    return 1;
  else if (n < 82)
    return 2;
  else if (n < 6724)
    return 0;
  else if (n < 50626)
    return 3;
  else if (n < vals[6])
    return 1;
  return 2;
}
int calc(int n) {
  int st = ceil(pow(n, 0.25));
  int end = floor(pow(n, 0.5));
  set<int> ss;
  if (n == 2 || n == 3) return 0;
  for (int i = 0; i <= (5); ++i) {
    if (st <= vals[i + 1]) {
      ss.insert(vv[i]);
    }
    if (vals[i + 1] > end) break;
  }
  for (int i = 0; i <= (8); ++i) {
    if (!((ss).find(i) != (ss).end())) {
      return i;
    }
  }
}
int x, z[1000000];
int main() {
  int n;
  scanf("%d", &n);
  int xorrr = 0;
  long long int x;
  for (int i = 1; i <= (n); ++i) {
    cin >> x;
    z[i] = grundy(x);
    xorrr ^= z[i];
  }
  if (xorrr == 0)
    printf("Rublo\n");
  else
    printf("Furlo\n");
  return 0;
}
