CodeForces - 347C Alice and Bob

It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to make the following moves. During each move, either Alice or Bob (the player whose turn is the current) can choose two distinct integers x and y from the set, such that the set doesn't contain their absolute difference |x - y|. Then this player adds integer |x - y| to the set (so, the size of the set increases by one).

If the current player has no valid move, he (or she) loses the game. The question is who will finally win the game if both players play optimally. Remember that Alice always moves first.

Input

The first line contains an integer n (2 ≤ n ≤ 100) — the initial number of elements in the set. The second line contains n distinct space-separated integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹) — the elements of the set.

Output

Print a single line with the winner's name. If Alice wins print "Alice", otherwise print "Bob" (without quotes).

Example

Input

2
2 3

Output

Alice

Input

2
5 3

Output

Alice

Input

3
5 6 7

Output

Bob

Note

Consider the first test sample. Alice moves first, and the only move she can do is to choose 2 and 3, then to add 1 to the set. Next Bob moves, there is no valid move anymore, so the winner is Alice.

题目的意思是Bob和Alice玩游戏给定n个数，每次选择两个数x，y 如果|x-y|不存在这一堆数中就把|x-y|加入进去，

如果没有满足情况的就无法取，最后谁取不到xy算输，每次都是Alice先开始。

这个题我刚开始以为就找最大值然后用最大值减去n就是能取到的xy的个数，但是一直卡在第15组数据，后来他们告诉我我想简单了...每次取到的|x-y|的值是n个数的最大公约数的倍数，例如有两个数6,9那么只能加进去一个3.

简单点说就是这个题就是找到n个数的最大公约数gcd，和n个数的最大值max，能取到x，y的个数就是max/gcd-n；

如果能取的次数是偶数Bob胜否则Alice胜.....

#include <iostream>
#include <cmath>
#include <algorithm>

using namespace std;

int main()
{
    int n, m, r, i, x, s = 0;
    cin>>n;
    for(i = 0;i < n;i++)
    {
        cin>>x;
        s = max(s,x);//记录最大值
        if(i == 0)
            m = x;
        else//求最大公约数
        {
            if(m > x)
            {
                r = x;
                x = m;
                m = r;
            }
            while(m)
            {
                r = x % m;
                x = m;
                m = r;
            }
            m = x;
        }
    }
    r = s / m;
    x = r - n;
    if(x % 2 == 0)
        cout<<"Bob"<<endl;
    else
        cout<<"Alice"<<endl;
    return 0;
}