#include <stdio.h>
#include <algorithm>

using namespace std;

int n , k;
int sg[1200];
int ex[120];
int ans;
void work () {
	int i , j , a, b , now;
	/*k = 8;
	sg[0] = 0;
	printf ( "0 " );
	for ( i = 1 ; i <= 100 ; i++ ) {
		for ( j = 0 ; j <= 10 ; j++ ) ex[j] = 0;
		for ( j = 1 ; j <= i ; j = j * k ) {
			ex[sg[i-j]] = 1;
		}
		for ( j = 0 ; j <= 10 ; j++ ) {
			if ( ex[j] == 0 ) {
				sg[i] = j;
				break;
			}
		}
		printf ( "%d " , sg[i] );
	}*/
	scanf ( "%d" , &n );
	for ( i = 1 ; i <= n ; i++ ) {
		scanf ( "%d%d" , &a , &b );
		if ( b % 2 == 0 ) {
			now = a % (b+1);
			if ( now == b ) now = 2;
			else now = now % 2;
		}
		else now = a % 2;
		ans ^= now;
	}
	if ( ans == 0 ) printf ( "Bob\n" );
	else printf ( "Alice\n" );
}
int main () {
	work ();
	return 0;
}