CodeForces 346A

A. Alice and Bob

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 a1, a2, ..., an (1 ≤ ai ≤ 109) — 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).

Examples

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.

题意：两个人轮流往集合中加数字，任意的集合中两个数字的差的绝对值，不可以添加已有的数字，谁先不能进行操作，则另一个人赢

思路：就是往里面加数字，添加的数字个数就是轮数，测试几组数据就能发现，这个集合容易发展成一个等差数列，像4 6 12就是一个2的等差数列，也就是说只要求出了差值d

就知道，这个数列有多少个数，减去原有的n个，剩下的就是轮数。求等差，就相当于求这几个数字的gcd。

#include<bits/stdc++.h>
using namespace std;
int gcd(int a,int b)
{
    return a == 0?b:gcd(b%a,a);
}
int main()
{
    int maxx = 0;
    int n,d;
    scanf("%d",&n);
    for(int i = 0;i < n;i++)
    {
        int num;
        scanf("%d",&num);
        maxx = max(maxx,num);
        if(i == 0)
            d = num;
        else
            d = gcd(d,num);
    }
    if(((maxx/d) - n)&1)
        printf("Alice\n");
    else
        printf("Bob\n");
    return 0;
}