---{"category_name":"easy","problem_code":"ALBOFACE","problem_name":"Alice vs Bob Faceoff","problemComponents":{"constraints":"- $1 \\le T \\le 2*10^5$\n\n- $1 \\le N \\le 10^{18} $","constraintsState":true,"subtasks":"- 10 points : $1 \\leq N \\leq 20$ , $1 \\leq T \\leq 20$\n- 30 points : $1 \\leq N \\leq 10^5$, $1 \\leq T \\leq 10^5$\n- 60 points : $1 \\leq N \\leq 10^{18}$\n","subtasksState":true,"inputFormat":"- The first line of input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.\n\n- The first line of each test case contains an integer $N$.","inputFormatState":true,"outputFormat":"For each test case, print \u0022Alice\u0022 if Alice wins the game else print \u0022Bob\u0022. Print the output without quotes.","outputFormatState":true,"sampleTestCases":{"0":{"id":1,"input":"2\n1\n2\n","output":"Alice\nBob","explanation":"**Test case $1$**: Alice can\u0027t perform the first move, hence she subtracts 1 from $N$ and $N$ becomes $0$. Bob can\u0027t make a move now.\n\n**Test case $1$**: Alice first divides $N$ by $2$ , after which $N$ becomes $1$. Bob, in the next move decrements $N$ by $1$ after which $N$ becomes $0$ and Alice loses.","isDeleted":false}}},"video_editorial_url":"https://youtu.be/5Xt-Z3c7Qbs","languages_supported":{"0":"CPP14","1":"C","2":"JAVA","3":"PYTH 3.6","4":"CPP17","5":"PYTH","6":"PYP3","7":"CS2","8":"ADA","9":"PYPY","10":"TEXT","11":"PAS fpc","12":"NODEJS","13":"RUBY","14":"PHP","15":"GO","16":"HASK","17":"TCL","18":"PERL","19":"SCALA","20":"LUA","21":"kotlin","22":"BASH","23":"JS","24":"LISP sbcl","25":"rust","26":"PAS gpc","27":"BF","28":"CLOJ","29":"R","30":"D","31":"CAML","32":"FORT","33":"ASM","34":"swift","35":"FS","36":"WSPC","37":"LISP clisp","38":"SQL","39":"SCM guile","40":"PERL6","41":"ERL","42":"CLPS","43":"ICK","44":"NICE","45":"PRLG","46":"ICON","47":"COB","48":"SCM chicken","49":"PIKE","50":"SCM qobi","51":"ST","52":"SQLQ","53":"NEM"},"max_timelimit":1,"source_sizelimit":50000,"problem_author":"munch_01","problem_tester":"","date_added":"22-09-2021","tags":{"0":"game","1":"ltime100","2":"munch_01","3":"simple"},"problem_difficulty_level":"Simple","best_tag":"Game Theory","editorial_url":"https://discuss.codechef.com/problems/ALBOFACE","time":{"view_start_date":1632585602,"submit_start_date":1632585602,"visible_start_date":1632585602,"end_date":1735669800},"is_direct_submittable":false,"problemDiscussURL":"https://discuss.codechef.com/search?q=ALBOFACE","is_proctored":false,"visitedContests":{},"layout":"problem"}---### Read problem statements in [Mandarin](https://www.codechef.com/download/translated/LTIME100/mandarin/ALBOFACE.pdf), [Bengali](https://www.codechef.com/download/translated/LTIME100/bengali/ALBOFACE.pdf), [Russian](https://www.codechef.com/download/translated/LTIME100/russian/ALBOFACE.pdf), and [Vietnamese](https://www.codechef.com/download/translated/LTIME100/vietnamese/ALBOFACE.pdf) as well.Alice and Bob have got an integer $N$. They decide to play a game. Alice and Bob make alternating moves: Alice makes the first move, Bob makes the second move, Alice makes the third one, and so on. The game continues until $N$ becomes $0$. The player who is unable to make a move loses.During each turn a player can make one of the following moves:1. Choose an integer $X$ such that $X$ can be expressed as $2^Y$, $Y \geq 1$. The chosen $X$ must also be a factor of $N$. After choosing an integer $X$ which satisfies the mentioned criteria, the player will divide $N$ by $X$.2. If Move $1$ is not possible , the player will subtract $1$ from $N$.Predict the winner of the game if the game is played optimally by both the players.<aside style='background: #f8f8f8;padding: 10px 15px;'><div>All submissions for this problem are available.</div></aside>