#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    int n;
    VVI cnt(2, VI(2));
    cin >> n;
    REP(i,n){
        int x, y;
        scanf("%d %d", &x, &y);
        cnt[x%2][y%2]++;
    }
    int s = 0;
    REP(i,2) REP(j,2) s += cnt[i][j] / 2;
    cout << (s % 2 ? "Alice" : "Bob") << endl;

    return 0;
}