#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N;
int cnt[2][2];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N;
    
    for(int i=0;i<N;++i){
        int x, y;
        std::cin >> x >> y;

        ++cnt[x&1][y&1];
    }

    int pair_n = 0;
    for(int i=0;i<2;++i){
        for(int j=0;j<2;++j){
            pair_n += cnt[i][j] / 2;
        }
    }

    const string YESNO[2] = {"Bob", "Alice"};
    std::cout << YESNO[pair_n & 1] << std::endl;
}