主页 讨论版 问题 名次 状态 统计
12月将举办首届西电ACM新生赛,敬请期待~~~~
问题 B: Furude_Rika and box

问题 B: Furude_Rika and box

时间限制: 1 Sec  内存限制: 128 MB
提交: 89  解决: 56
[提交][状态][讨论版]

题目描述

Furude_Rika has a deck of cards. Every card has a unique integer number written on it.She says that her cards are numbered starting from 1, and if a card with number N exists, then a card with number N+1 exists.

Yes She may have an infinite sequence !

Yesterday when she went to school, her roommate Satoko played with her cards by sorting them into two boxes according to the numbers written on them by repeating the following two steps:

1.Take the card with the smallest number, let it be X.

2.Put the card with number X in the first box and put the card with number 2*X in the second box.

So the first few numbers in the boxes will be:

First box : 1,3,4,5,7,...

Second box : 2,6,8,10,14,...

Furude_Rika came back home and she asked Satoko for the card with number Q written on it. Help Satoko to find out in which box she can find the required card.

输入

The first line is an interger T,the number of test cases.(T<=200000)

next T lines,each line contains an interger Q(1<=Q<=1000000000000000000)

输出

For every test case print "First Box" if the card is in the first box or "Second Box" otherwise.

样例输入

3
1
6
1024

样例输出

First Box
Second Box
First Box

提示

Please don't use "cin"  or "cout"  in c++ as it may cause TLE


Instead,you can use "scanf("%lld",&...)" .

[提交][状态][讨论版]