跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2600. Furlo and Rublo and Game

  • ID: 2606
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:提高
  • 上传者:
  • 博弈
  • 模拟
  • 数学
  • 编程与模拟
  • 提高
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Furlo and Rublo and Game

题目描述

E. Furlo and Rublo and Game
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Furlo and Rublo play a game. The table has n piles of coins lying on it, the i-th pile has ai coins. Furlo and Rublo move in turns, Furlo moves first. In one move you are allowed to:

  • choose some pile, let's denote the current number of coins in it as x;
  • choose some integer y (0≤y<x;x1/4≤y≤x1/2) and decrease the number of coins in this pile to y. In other words, after the described move the pile will have y coins left.

The player who can't make a move, loses.

Your task is to find out, who wins in the given game if both Furlo and Rublo play optimally well.

Input

The first line contains integer n (1≤n≤77777) − the number of piles. The next line contains n integers a1,a2,...,an (1≤ai≤777777777777) − the sizes of piles. The numbers are separated by single spaces.

Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.

Output

If both players play optimally well and Furlo wins, print "Furlo", otherwise print "Rublo". Print the answers without the quotes.

Examples
Input
1
1
Output
Rublo
Input
2
1 2
Output
Rublo
Input
10
1 2 3 4 5 6 7 8 9 10
Output
Furlo

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2252 题。保留原作者与原赛事署名。