# Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

# Free Mango

By Aungkur · Limits 1s, 256 MB

Alice has a magical mango garden. There are $10^6$ mango trees. the magically $i$-th tree has $D(i)$ number of mangoes. Here, $D(i)$ represents the number of the divisors of $i$.

Bob wants to buy all the mangoes. Before buying mangoes, Alice offered to Bob that if Bob could answer all the queries correctly, Alice would give the mangoes for free.

Alice will ask $Q$ queries. Each of them will contain a range $[L, R]$. Now, Alice and Bob will play a game. Alice will make the first move. He will choose a tree from the range $[L, R]$ and collect mangoes from it as many as he wants. Then Bob will do the same. The person who can't collect any mangoes in his turn loses the game. Bob will have to answer who will win if both of them collect mangoes optimally. (At the beginning of each query, magically the number of mangoes in the $i$-th tree will be $D(i)$)

FYI: Bob gets the mangoes for free. Now, you have to say what was Bob’s answer for each query.

## Input

The first line contains a integer $Q (1 \leq Q \leq 10^5)$, the number of queries.

Next $Q$ lines contain two positive integers $L, R (1\leq L\leq R\leq 10^6)$, denotes the left and the right ends of the corresponding range.

## Output

For each query, print $\texttt{“Alice”}$(without quotes) if Bob’s answer was “Alice will win”, otherwise print $\texttt{“Bob”}$(without quotes).

## Sample

InputOutput
3
1 3
2 3
3 9

Alice
Bob
Alice


### Statistics

49% Solution Ratio

pathanFastest, 0.0s

YouKnowWhoLightest, 4.6 MB

YouKnowWhoShortest, 461B