/*

Author: Haze

2024/4/25

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll read() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;

int calc(int x){
    if(x == 0)return 0;
    for(int y = 1; y <= x; y *= 7){
        if(calc(x - y) == 0)return 1;
    }
    return 0;
}

void solve() {
    int n = read();
    ll c = 0;
    irep(i, 1, n){
        ll a = read(), b = read();
        if(b & 1){
            c += (a % 2);
        }
        else{
            if(a % (b + 1) % 2 == 0){
                if(a % (b + 1) != b){
                    continue;
                }
            }
            ++ c;
        }
    }
    if(c % 2 ==1)cout << "Alice";
    else cout << "Bob";
}

int main() {
    // IOS
    //
    solve();
    return 0;
    irep(i, 0, 64){
        cout << i <<' '<< calc(i) <<  endl;
    }
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}