#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <fstream>
#include <set>
#include <utility>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
#include <numeric>
#include <sstream>
#include <list>
#include <map>
#include <functional>
#include <iterator>

#define rep(i,p,n) for(int i=(int)p;i<(int)n;i++)
#define repp(i,p,n) for(int i=(int)p;i>=(int)n;i--)
#define Sort(x) sort(x.begin(),x.end())
#define PSort(x) sort(begin(x), end(x), pairCompare)
#define ll long long
#define INF 2000000000
#define pb push_back
#define mp make_pair

using namespace std;

int main() {
	int n;
	cin >> n;
	vector<pair<int, int>> oo, oe, ee, eo;
	rep(i, 0, n) {
		int a, b;
		scanf("%d%d", &a, &b);
		if (a%2 == 0 && b%2 == 0)ee.pb(mp(a,b));
		if (a % 2 == 1 && b % 2 == 0)oe.pb(mp(a, b));
		if (a % 2 == 1 && b % 2 == 1)oo.pb(mp(a, b));
		if (a % 2 == 0 && b % 2 == 1)eo.pb(mp(a, b));
	}

	int ans = (ee.size()) / 2 + (oe.size()) / 2 + (eo.size()) / 2 + (oo.size()) / 2;
	if (ans % 2 == 0 || ans==0 )cout << "Bob" << endl;
	else cout << "Alice" << endl;
	return 0;
}