#include<iostream>
#include<algorithm>

using namespace std;


typedef unsigned long long ull;
const ull NMAX = 100000;
ull N;


typedef struct point{
	ull  x ;
	ull  y ;
}point;

point A[NMAX];

int main(void){
	
	cin >> N;
	
	for(int j = 0 ; j < N; j++){
		cin >> A[j].x ;
		cin >> A[j].y ;
	}
	
	int eo = 0;
	int oe = 0;
	int ee = 0;
	int oo = 0;
	int m = 0;
	
//	cout << eo << endl;
	
	for(int i = 0; i < N; i++){
		if((A[i].x % 2 == 0) && (A[i].y % 2 !=0)) eo++ ;
		if (A[i].x % 2 != 0 && A[i].y % 2 == 0) oe++ ;
		if (A[i].x % 2 == 0 && A[i].y % 2 == 0) ee++ ;
		if (A[i].x % 2 != 0 && A[i].y % 2 != 0) oo++ ; 
	}
//	cout << eo << endl;
//	cout << oe << endl;
//	cout << ee << endl;
//	cout << oo << endl; 
	
	m = eo/2 + oe/2 + ee/2 + oo/2 ;
	if(m % 2 == 0) cout << "Bob" << endl;
	else cout << "Alice" << endl;
	
	
	
	
	return 0;}