Alice and Bob (CodeForces - 346A )

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 ndistinct 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.

题意：两个
人进行游戏，每个人轮流从数组种选出两个不同的数x,y;如果|x-y| 不存在于数组中，就把|x-y|插入这个数组，否则，游戏结束，无法继续操作的那个人失败。

解题思路：可以先想一下最后的状态，即任选x，y。|x-y| 都已经存在与数组中。什么样的数组满足最终状态呢？联想一下数学上首项等于共差的等差数列，是不是恰好满足要求。

假设等差数列为d, 2d, 3d,4d.......................;

这里关键在于怎么求d,可以很清楚的看出来，d为这个数列所有元素的最大公约数，所以求出这个最大公约数，我们用新数列的长度减去原来数列的长度就可以判断结果了。

上代码：

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int gcd(int a,int b)
{
	return b==0? a:gcd(b,a%b);
}
int a[101];
int main()
{
   int n;
   int maxn = 0;
   scanf("%d", &n);
   for(int i=0;i<n;i++)
     {
	  scanf("%d", &a[i]);
	  maxn = max(maxn, a[i]);
     }  
	int tmp = maxn;
    
	for(int i=0; i<n; i++)
     {
     	tmp = gcd(tmp,a[i]);
     }
   int x =  maxn/tmp - n;
   if(x%2==1)
   printf("Alice\n");
   else
   printf("Bob\n");
   return 0;
}

水波.