import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.math.MathContext;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==================================================================
    public void solve() {
    	int[] cnt = new int[4];		// 0 : 奇奇　　1 : 奇偶　　2:　偶奇　　3:　偶偶
    	int N = Integer.parseInt(sc.next());
    	int x, y;
    	for (int i = 0; i < N; i++) {
    		x = Integer.parseInt(sc.next());
    		y = Integer.parseInt(sc.next());
    		if((x & 1) == 1 && (y & 1) == 1)		cnt[0]++;
    		else if((x & 1) == 1 && (y & 1) == 0)	cnt[1]++;
    		else if((x & 1) == 0 && (y & 1) == 1)	cnt[2]++;
    		else if((x & 1) == 0 && (y & 1) == 0)	cnt[3]++;
		}
    	int ans = cnt[0] / 2 + cnt[1] / 2 + cnt[2] / 2 + cnt[3] / 2;
    	out.println(ans % 2 == 0 ? "Bob" : "Alice");
    }
}