A. Alice and Bob----最大公约数

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.

题目连接：http://codeforces.com/contest/346/problem/A

题目的意思是说A和B两个人轮流用集合中的两个数做减法取绝对值。减出来的商集合中不能重复，谁不能减了谁就输了。

这个能做出来属于运气，刚拿到这个题一点头绪都没有，想不到和什么知识点有关系，老规矩，先想暴力，我想了bfs暴力，发现虽然只有100个数但是时间复杂度我还是撑不住，然后我试了第三组示例发现1,2,3,4,5,6,7都可以出来，又试了第二组示例，1,2,3,4,5都能出来，又试了2,4,8，发现只能出来2,4,6,8。就猜测与最大公约数有关，试了第一发，用每个数除以最大公约数然后减去已知的数，光荣的wa了，细想之后发现每个数除以最大公约数的话就会有重复，本想hash去重，然后发现直接用最大的数除最大公约数就可以了，然后减去已知的数的个数，然后就没有然后了，ac。

代码：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int a[1000];
int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    sort(a,a+n);
    int k=a[0];
    for(int i=0;i<n;i++){
        k=__gcd(k,a[i]);//求n个数的最大公约数
    }
    int sum=0;
    /*for(int i=0;i<n;i++){
        sum+=(a[i]-k)/k;
    }
    sum-=n;*/
    sum=a[n-1]/k-n;
    if(sum%2)
        printf("Alice\n");
    else
        printf("Bob\n");
    return 0;
}