#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

// set<P> st;

int main()
{
    int n;
    scanf("%d",&n);
    // assert(n>=2 && n<=100000);
    int kind[4] = {};    //(0,0),(1,0),(0,1),(1,1)
    rep(i,n){
        int u,v;
        scanf("%d%d",&u,&v);
        // st.insert({min(u,v),max(u,v)});
        // assert(u >= 0 && u <= 1000000000);
        // assert(v >= 0 && v <= 1000000000);
        if(u % 2 == 0){
            if(v % 2 == 0){
                ++kind[0];
            }else{
                ++kind[1];
            }
        }else{
            if(v % 2 == 0){
                ++kind[2];
            }else{
                ++kind[3];
            }
        }
    }
    // assert(len(st) == n);
    int cnt = kind[0]/2 + kind[1]/2 + kind[2]/2 + kind[3]/2;
    if(cnt % 2){
        cout << "Alice\n";
    }else{
        cout << "Bob\n";
    }
    return 0;
}