#include <bits/stdc++.h>
using namespace std;
class mexMap {
 private:
  map<int, int> S;
  int MEX;

 public:
  mexMap() { MEX = 0; }
  int get() { return MEX; }
  void insert(int v) {
    S[v]++;
    if (v == MEX) {
      map<int, int>::iterator it = S.find(v);
      for (; it != S.end(); it++) {
        if (MEX != it->first) break;
        MEX++;
      }
    }
  }
  void erase(int v) {
    S[v]--;
    if (v < MEX && S[v] == 0) MEX = v;
    if (S[v] == 0) S.erase(v);
  }
};
long long getL(long long x) {
  long long l = 0, y, r = 10000;
  while (l != r) {
    y = (l + r) / 2;
    if (x <= y * y * y * y)
      r = y;
    else
      l = y + 1;
  }
  return l;
}
long long getR(long long x) {
  long long l = 0, y, r = 1000000000ll;
  while (l != r) {
    y = (l + r + 1) / 2;
    if (y * y <= x)
      l = y;
    else
      r = y - 1;
  }
  return l;
}
const int MAX = 1001000;
int dp[MAX];
long long a[MAX];
int acc[5][MAX];
int grundy(long long val) {
  if (val < MAX)
    return dp[val];
  else {
    long long l = getL(val), r = getR(val);
    for (int i = 0; i < int(5); i++)
      if (acc[i][r] - acc[i][l - 1] == 0) return i;
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < int(n); i++) scanf("%lld", a + i);
  long long l, r;
  for (int x = 0; x < int(50); x++) {
    l = -1;
    set<int> S;
    for (int y = 0; y < int(x); y++) {
      if (y < x && x <= y * y * y * y && y * y <= x) {
        if (l == -1) l = y;
        r = y;
        S.insert(dp[y]);
      }
    }
    int cnt = 0;
    for (__typeof((S).begin()) v = (S).begin(); v != (S).end(); v++) {
      if (*v != cnt) break;
      cnt++;
    }
    dp[x] = cnt;
  }
  mexMap S;
  for (int i = l; i <= r; i++) S.insert(dp[i]);
  long long x = 50;
  int i = 50;
  int mx = 0;
  for (; x < MAX; x++) {
    long long y = r;
    while ((y + 1) * (y + 1) <= x) {
      y++;
      r++;
      S.insert(dp[r]);
    }
    y = l;
    while (x > y * y * y * y) {
      S.erase(dp[l]);
      y++;
      l++;
    }
    dp[i] = S.get();
    i++;
  }
  for (int i = 0; i < int(MAX); i++) acc[dp[i]][i]++;
  for (int i = 1; i < MAX; i++)
    for (int j = 0; j < int(5); j++) acc[j][i] += acc[j][i - 1];
  int xr = 0;
  for (int i = 0; i < int(n); i++) xr ^= grundy(a[i]);
  if (xr != 0)
    printf("Furlo\n");
  else
    printf("Rublo\n");
}
