N = 31
n = 0
a1 = 0
a2 = 0
b1 = 0
b2 = 0
c1 = 0
c2 = 0
d1 = 0
d2 = 0
dp = [[[[[[0 for _ in range(2)] for _ in range(4)] for _ in range(4)] for _ in range(N)] for _ in range(N)] for _ in range(2*N)]
vis = [[[[[[0 for _ in range(2)] for _ in range(4)] for _ in range(4)] for _ in range(N)] for _ in range(N)] for _ in range(2*N)]
dx = [0,1,0,-1]
dy = [1,0,-1,0]
def cp1(x1,y1,xx,yy):
    global a1,b1,c1,d1
    if x1==a1 and y1==b1 and xx==c1 and yy==d1:
        return True
    if x1==c1 and y1==d1 and xx==a1 and yy==b1:
        return True
    return False
def cp2(x1,y1,xx,yy):
    global a2,b2,c2,d2
    if x1==a2 and y1==b2 and xx==c2 and yy==d2:
        return True
    if x1==c2 and y1==d2 and xx==a2 and yy==b2:
        return True
    return False
def chk(x1,y1,x2,y2,t1,t2):
    d = abs(x1-x2)+abs(y1-y2)
    if d<=1:
        if t1&1:
            return 1
        if t2&1:
            return -1
    if x1==x2 or y1==y2:
        if t1&2:
            return 1
        if t2&2:
            return -1
    return 0

def f(X,y1,y2,t1,t2,T):
    global vis,dp,dx,dy,n
    x1 = X+2-y1
    x2 = 2*n-X-y2+T
    # print(x1,y1,x2,y2)
    if vis[X][y1][y2][t1][t2][T]:
        return dp[X][y1][y2][t1][t2][T]
    # print(x1,y1,x2,y2,t1,t2)
    vis[X][y1][y2][t1][t2][T]=True
    if x1==n and y1==n and x2==1 and y2==1:
        dp[X][y1][y2][t1][t2][T]=0
        return 0
    t=1-T
    if t==1:
        ansk=-1
        for k in range(0,2):
            xx=x1+dx[k]
            yy=y1+dy[k]
            if xx<1 or xx>n or yy<1 or yy>n:
                continue
            if ((t2&1)!=1) and cp1(x1,y1,xx,yy):
                d=chk(xx,yy,x2,y2,t1+1,t2)
                if d==1:
                    dp[X][y1][y2][t1][t2][T]=1
                    return 1
                elif d==-1:
                    continue
                d=f(X+1,yy,y2,t1+1,t2,1)
                if(d==1):
                    dp[X][y1][y2][t1][t2][T]=1
                    return 1
                ansk=max(ansk,d)
            if ((t2&2)!=2) and cp2(x1,y1,xx,yy):
                d=chk(xx,yy,x2,y2,t1+2,t2)
                if d==1:
                    dp[X][y1][y2][t1][t2][T]=1
                    return 1
                elif d==-1:
                    continue
                d=f(X+1,yy,y2,t1+2,t2,1)
                if(d==1):
                    dp[X][y1][y2][t1][t2][T]=1
                    return 1
                ansk=max(ansk,d)
            d=chk(xx,yy,x2,y2,t1,t2)
            if d==1:
                dp[X][y1][y2][t1][t2][T]=1
                return 1
            elif d==-1:
                continue
            d=f(X+1,yy,y2,t1,t2,1)
            if(d==1):
                dp[X][y1][y2][t1][t2][T]=1
                return 1
            ansk=max(ansk,d)
        dp[X][y1][y2][t1][t2][T]=ansk
        return ansk
    else:
        ansk=1
        for k in range(2,4):
            xx=x2+dx[k]
            yy=y2+dy[k]
            if(xx<1 or xx>n or yy<1 or yy>n):
                continue
            if((t1&1)!=1) and (cp1(x2,y2,xx,yy)):
                d=chk(x1,y1,xx,yy,t1,t2+1)
                if(d==-1):
                    dp[X][y1][y2][t1][t2][T]=-1
                    return -1
                elif(d==1):
                    continue
                d=f(X,y1,yy,t1,t2+1,0)
                if(d==-1):
                    dp[X][y1][y2][t1][t2][T]=-1
                    return -1
                ansk=min(ansk,d)
            if((t1&2)!=2) and (cp2(x2,y2,xx,yy)):
                d=chk(x1,y1,xx,yy,t1,t2+2)
                if(d==-1):
                    dp[X][y1][y2][t1][t2][T]=-1
                    return -1
                elif(d==1):
                    continue
                d=f(X,y1,yy,t1,t2+2,0)
                if(d==-1):
                    dp[X][y1][y2][t1][t2][T]=-1
                    return -1
                ansk=min(ansk,d)
            d=chk(x1,y1,xx,yy,t1,t2)
            if d==-1:
                dp[X][y1][y2][t1][t2][T]=-1
                return -1
            elif d==1:
                continue
            d=f(X,y1,yy,t1,t2,0)
            if(d==-1):
                dp[X][y1][y2][t1][t2][T]=-1
                return -1
            ansk=min(ansk,d)
        dp[X][y1][y2][t1][t2][T]=ansk
        return ansk



def main():
    return
    tests = int(input())
    for i in range(tests):
        global n,a1,a2,b1,b2,c1,c2,d1,d2,vis
        str = input().split(" ")
        n=int(str[0])
        a1=int(str[1])
        b1=int(str[2])
        c1=int(str[3])
        d1=int(str[4])
        a2=int(str[5])
        b2=int(str[6])
        c2=int(str[7])
        d2=int(str[8])
        N=n+1
        for X in range(0,2*N):
            for y1 in range(0,N):
                for y2 in range(0,N):
                    for t1 in range(0,4):
                        for t2 in range(0,4):
                            for t in range(0,2):
                                vis[X][y1][y2][t1][t2][t]=0
        d = 1 #f(0,1,n,0,0,0)
        if d==1:
            print("Alice")
        elif d==-1:
            print("Bob")
        else:
            print("0")

main()