#include <iostream>
#include <iomanip>
#include <cstring>
#include <algorithm> 
#include <math.h>
#include <queue>
#include <functional>
#include <map>
#include <vector>
#include <string>
using namespace std;
typedef long long ll;



int main(void){
    int n;
    int a[2][2];
    cin >> n;
    for (int i = 0; i < 2; i++)
        for (int j = 0; j < 2; j++) a[i][j] = 0;

    for (int i = 0; i < n; i++){
        int s = 0, t = 0;
        cin >> s >> t;
        a[s % 2][t % 2]++;
    }

    int count = 0;
    for (int i = 0; i < 2; i++)
        for (int j = 0; j < 2; j++) count += a[i][j] / 2;

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

}