#include <bits/stdc++.h>
int tr[888888 + 888888];
void update(int i, int b) {
  tr[i += 888888] = b;
  while (i > 1) {
    i >>= 1;
    tr[i] = tr[i << 1] | tr[i << 1 | 1];
  }
}
int query(int l, int r) {
  int b = 0;
  for (l += 888888, r += 888888; l <= r; l >>= 1, r >>= 1) {
    if ((l & 1) == 1) b |= tr[l++];
    if ((r & 1) == 0) b |= tr[r--];
  }
  return b;
}
int query_(long long a) {
  int l = pow(a, 0.25), r = sqrt(a), b, x;
  while ((long long)l * l * l * l < a) l++;
  while ((long long)(l - 1) * (l - 1) * (l - 1) * (l - 1) >= a) l--;
  while ((long long)r * r > a) r--;
  while ((long long)(r + 1) * (r + 1) <= a) r++;
  b = query(l, r);
  x = 0;
  while (b & 1 << x) x++;
  return x;
}
void init() {
  int a;
  update(0, 1 << 0);
  update(1, 1 << 0);
  for (a = 2; a < 888888; a++) update(a, 1 << query_(a));
}
int main() {
  int n, grundy;
  init();
  scanf("%d", &n);
  grundy = 0;
  while (n--) {
    long long a;
    scanf("%lld", &a);
    grundy ^= a < 2 ? 0 : query_(a);
  }
  printf(grundy ? "Furlo\n" : "Rublo\n");
  return 0;
}
