#include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cstring>
#include<cmath>
#include<numeric>
#include<queue>
#include<climits>
#include<cstdio>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
//#define INF ((LLONG_MAX) / (2))
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
typedef long long int ll;
typedef pair<ll,int> LL_IP;
typedef pair<ll,ll> LL_LLP;
#define INF 1e9+7


int main(){

    int n,count = 0;
    cin >> n;
    vector<P> arr(n);
    REP(i,n){
        cin >> arr[i].first >> arr[i].second;
    }

    int a=0,b=0,c=0,d=0;
    REP(i,n){
        if(arr[i].first % 2 == 0 && arr[i].second % 2 == 0){
            a++;
        }
        if(arr[i].first % 2 == 1 && arr[i].second % 2 == 1){
            b++;
        }
        if(arr[i].first % 2 == 1 && arr[i].second % 2 == 0){
            c++;
        }
        if(arr[i].first % 2 == 0 && arr[i].second % 2 == 1){
            d++;
        }
    }

    int ans = a/2+b/2+c/2+d/2;
    if(ans % 2 == 0){
        cout << "Bob" << endl;
    }else{
        cout << "Alice" << endl;
    }
   
    return 0;
}