#include<bits/stdc++.h>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
ll bpow(ll,ll,ll);
typedef vector<int> vec;
typedef vector<vec> mat;
mat mul(mat &A,mat &B);
mat pow(mat A,ll n);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};

vector<int> primes(0);
vector<bool> prime(400000,true);
void erast(){
  prime[0] = false;
  prime[1] = false;
  for(int i=2;i<400000;i++){
    if(prime[i]){
      primes.push_back(i);
      for(int j=i+i;j<400000;j+=i){
        prime[j] = false;
      }
    }
  }
}
bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}
int main()
{
  int poe=0,peo=0,poo=0,pee=0,cnt=0;
  int N,x,y;
  cin >> N;
  REP(i,N){
    cin >> x >> y;
    if(x%2){
      if(y%2)
        poo++;
      else
        poe++;
    }else{
      if(y%2)
        peo++;
      else
        pee++;
    }
  }
  cnt = poo/2+poe/2+peo/2+pee/2;
  cout << (cnt%2 ? "Alice" : "Bob") << endl;
  return 0;
}