#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include <iomanip>
#include <cmath>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL<<60

int cnt[2][2];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N; cin >> N;
	for (int i = 0; i < N; i++) {
		int x, y; cin >> x >> y;

		for (int a = 0; a < 2; a++) {
			for (int b = 0; b < 2; b++) {
				if (x % 2 == a && y % 2 == b) cnt[a][b]++;
			}
		}
	}

	int num = 0;
	for (int a = 0; a < 2; a++) {
		for (int b = 0; b < 2; b++) {
			num += cnt[a][b] / 2;
		}
	}

	if (num % 2 == 0) cout << "Bob" << endl;
	else cout << "Alice" << endl;

	return 0;
}