Problem:
 Score : 300 points    Problem Statement A game is played on a strip consisting of N cells consecutively numbered from 1 to N .  Alice has her token on cell A . Borys has his token on a different cell B .  Players take turns, Alice moves first.
The moving player must shift his or her token from its current cell X to the neighboring cell on the left, cell X-1 , or on the right, cell X+1 .
Note that it's disallowed to move the token outside the strip or to the cell with the other player's token.
In one turn, the token of the moving player must be shifted exactly once.  The player who can't make a move loses, and the other player wins.  Both players want to win. Who wins if they play optimally?      Constraints  2 \leq N \leq 100  1 \leq A < B \leq N  All input values are integers.         Input Input is given from Standard Input in the following format:  N  A  B       Output Print Alice if Alice wins, Borys if Borys wins, and Draw if nobody wins.        Sample Input 1 5 2 4      Sample Output 1 Alice  Alice can move her token to cell 3. 
After that, Borys will be unable to move his token to cell 3, so he will have to move his token to cell 5. 
Then, Alice moves her token to cell 4. Borys can't make a move and loses.       Sample Input 2 2 1 2      Sample Output 2 Borys  Alice can't make the very first move and loses.       Sample Input 3 58 23 42      Sample Output 3 Borys

Solution (Python):
N, A, B = map(int, input().split())

if (A - B) % 2:
    print('Borys')
else:
    print('Alice')

Solution (Python):
N, A, B = list(map(int, input().split()))
print('Alice') if (A+B) % 2 == 0 else print('Borys')

Solution (Python):
N, A, B = map(int, input().split())
if (B - A - 1) % 2 == 0:
    print ('Borys')
else:
    print ('Alice')

Solution (Python):
n,a,b=map(int,input().split())
if (a-b)%2==0:
    print("Alice")
else:print("Borys")

Solution (Python):
n,a,b = map(int,input().split())
if (a-b) %2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
N, A, B = map(int, input().split())
if (B - A) & 1:
    print("Borys")
else:
    print("Alice")

Solution (Python):
n,a,b=map(int,input().split())
if (b-a)%2==0:
	print("Alice")
else:
	print("Borys")

Solution (Python):
import sys
input=sys.stdin.readline

n,a,b=map(int, input().split())

if (b-a)%2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N,A,B=map(int,input().split())

if abs(B-A)%2==1:
    print("Borys")
else:
    print("Alice")

Solution (Python):
n,a,b = map(int,input().split())
if (a+b)%2==0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
n,a,b=map(int,input().split())
if (b-a+1)%2==0:
    print("Borys")
else:
    print("Alice")

Solution (Python):
n, a, b = map(int, input().split())

if (b - a) % 2 == 0:
  print("Alice")
else:
  print("Borys")

Solution (Python):
N, A, B = map(int, input().split())

if abs(A - B) % 2 == 1:
    print("Borys")
else:
    print("Alice")

Solution (Python):
n,a,b=map(int,input().split());print("ABloircyes"[(b-a)%2::2])

Solution (Python):
N,A,B = map(int,input().split())

if (B-A-1)%2 == 0:
    print("Borys")
else:
    print("Alice")

Solution (Python):
n, a, b = map(int, input().split())

if (a-b-1) % 2 == 0:
    print('Borys')
else:
    print('Alice')

Solution (Python):
N,A,B=map(int,input().split())
print("Borys" if (B-A-1)%2==0 else "Alice")

Solution (Python):
n, a, b = map(int, input().split())

if (b-a)  % 2 == 0:
    ans = 'Alice'
else:
    ans = 'Borys'

print(ans)

Solution (Python):
import sys
input = sys.stdin.readline

N,A,B = map(int,input().split())
answer = 'Alice' if (B-A)%2==0 else 'Borys'
print(answer)

Solution (Python):
N,A,B=map(int,input().split())
if (A-B)%2==0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N, A, B = map(int, input().split())
if (A-B)%2==0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
N, A, B = map(int,input().split())
if (B-A) % 2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):

n, a, b = map(int, input().split())
if abs(a-b)%2==0:
  print("Alice")
else:
  print("Borys")

Solution (Python):
from sys import stdin
N,A,B = [int(x) for x in stdin.readline().rstrip().split()]
if (B - A) % 2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
a,b,c = map(int, input().split())
if (c-b) % 2 == 0:
  print('Alice')
else:
  print('Borys')

Solution (Python):
n,a,b = map(int, input().split())
print("Alice" if abs(b-a) % 2 == 0 else "Borys")

Solution (Python):

def main():
    n, a, b = tuple(map(int, input().rstrip().split()))
    d = b - a - 1
    print("Alice" if d % 2 == 1 else "Borys")


if __name__ == "__main__":
    main()

Solution (Python):
if __name__ == "__main__":
    n,a,b = map(int,input().split())
    if (b-a)%2==0:
        print("Alice")
    else:
        print("Borys")

Solution (Python):
N, A, B = map(int, input().split())
if (B-A) % 2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
n, a, b = map(int, input().split())

if (b - a - 1) % 2 == 0:
    print('Borys')
else:
    print('Alice')

Solution (Python):
N, A, B = map(int, input().split())

if (A - B) % 2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N,A,B = map(int,input().split())
if (B-A)%2==0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
print('ABloircyes'[eval(input()[2:].replace(' ','-'))%2::2])

Solution (Python):
print('ABloircyes'[eval(input()[2:].replace(' ','-'))%2::2])

Solution (Python):
n,a,b=map(int,input().split())
if (b-a)%2==0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N,A,B=map(int,input().split())
if (B-A)%2==0:
  print("Alice")
else:
  print("Borys")

Solution (Python):
n, a, b = map(int, input().split())

if a == 1 and b == 2 or (b - a) % 2:
    print("Borys")
else:
    print("Alice")

Solution (Python):
N,A,B=map(int,input().split())
if (B-A)%2==1:
  print('Borys')
else:
  print('Alice')

Solution (Python):
N, A, B = map(int, input().split())
if (A + B) % 2 == 0:
  print("Alice")
else:
  print("Borys")

Solution (Python):
N, A, B = map(int, input().split()) 

if A == N-1 and B == N:
    print('Borys')
elif (B-A) % 2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):


import sys

sys.setrecursionlimit(10**7)


def read_h(typ=int):
    return list(map(typ, input().split()))


def read_v(n, m=1, typ=int):
    return [read_h() if m > 1 else typ(input()) for _ in range(n)]


def main():
    N, A, B = read_h()

    if A % 2 == B % 2:
        print('Alice')
    else:
        print('Borys')


if __name__ == '__main__':
    main()

Solution (Python):
row = list(map(int, input().split()))

if (row[2] - row[1]) % 2 == 1:
    print("Borys")
else:
    print("Alice")

Solution (Python):

import sys
from operator import itemgetter

from fractions import gcd

from math import ceil, floor

from copy import deepcopy

from itertools import accumulate






from collections import Counter
import math
from functools import reduce
sys.setrecursionlimit(200000)

input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
def debug(*args, sep=" ", end="\n"): print("debug:", *args, file=sys.stderr, sep=sep, end=end) if not __debug__ else None



if not __debug__:
    fin = open('in_3.txt', 'r')
    sys.stdin = fin




def iterate_tokens():
    for line in sys.stdin:
        for word in line.split():
            yield word


if __name__ == '__main__':
    tokens = iterate_tokens()
    N = int(next(tokens))  
    A = int(next(tokens))  
    B = int(next(tokens))  

    if (A - B) % 2 == 0:
        print('Alice')
    else:
        print('Borys')

Solution (Python):
n,a,b=map(int,input().split())
print('Alice' if (b-a)%2==0 else 'Borys')

Solution (Python):
n, a, b = [ int(v) for v in input().split() ]
if (a - b) % 2 == 0:
  print("Alice")
else:
  print("Borys")

Solution (Python):
n, a, b = map(int, input().split())




if (b - a) % 2:
  print('Borys')
else:
  print('Alice')

Solution (Python):
n,a,b=map(int,input().split());print("Alice"if(b-a)%2==0 else"Borys")

Solution (Python):
a,b,c = map(int,input().split())
if (b-c)%2==0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
N,A,B=map(int,input().split())
print("ABloircyes"[(B-A)%2::2])

Solution (Python):
N,A,B = map(int,input().split())
print("Borys" if (B-A)%2 else "Alice")

Solution (Python):
n,a,b=map(int,input().split())
if a==1 and b==2:
  print('Borys')
elif (b-a)%2==0:
  print('Alice')
else:
  print('Borys')

Solution (Python):
N, A, B = map(int, input().split())

if 0 == (B - A - 1) % 2:
	print("Borys")
else:
	print("Alice")

Solution (Python):
N, A, B= map(int, input().split())
if (abs(A-B)-1) % 2 == 1: print('Alice')  
else: print('Borys')

Solution (Python):
def main():
    N, A, B = map(int, input().split())
    if (B - A) % 2 == 0:
        print("Alice")
    else:
        print("Borys")


if __name__ == "__main__":
    main()

Solution (Python):
a = list(map(int, input().split()))

if (a[2]-a[1])%2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
n,a,b=map(int,input().split())
ans='Borys' if (b-a+1)%2==0 else 'Alice'
print(ans)

Solution (Python):
n, a, b = [int(i) for i in input().split()]
k = abs(a-b-1)
if k%2 == 0:
    print("Borys")
else:
    print("Alice")

Solution (Python):
n,a,b=map(int,input().split())
if (b-a)%2==0:
    print("Alice")
else:
    print("Borys")

Solution (Python):





n, a, b = map(int, input().split())
dif = max(a, b) - min(a, b)
print("Borys" if dif % 2 == 1 else "Alice")

Solution (Python):
n,a,b=map(int,input().split())
between=b-a-1
if between%2==0:
    print('Borys')
else:
    print('Alice')

Solution (Python):
import sys
n, a, b = map(int, input().split())
if (b - a) % 2 == 1:
    ans = "Borys"
else:
    ans = "Alice"
print(ans)

Solution (Python):

"""
A - Move and Win
https://atcoder.jp/contests/agc020/tasks/agc020_a

"""
import sys


def solve(N, A, B):
    if (A-B)%2:
        return 'Borys'
    return 'Alice'


def main(args):
    N, A, B = map(int, input().split())
    ans = solve(N, A, B)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):

import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())


N,A, B = mi()

if (B-A-1)%2 == 0: print('Borys')
else: print('Alice')

Solution (Python):
N,A,B=map(int,input().split())
if (A-B)%2==0:
  print("Alice")
else:
  print("Borys")

Solution (Python):
N, A, B = map(int, input().split())
if (B + A) % 2 == 1:
    print('Borys')
else:
    print('Alice')

Solution (Python):
n,a,b=map(int,input().split())
if (b-a)%2==0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
n, a, b = [int(item) for item in input().split()]
if (b - a) % 2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N, A, B = map(int, input().split())

if (B - A) % 2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
n,a,b=map(int,input().split())
ans=['Alice','Borys']
if (b-a)%2==0:
    i=0
else:
    i=1
print(ans[i])

Solution (Python):
n, a, b = list(map(int, input().split()))
if (b-a)%2 == 0:
  print('Alice')
elif (b-a)%2 == 1:
  print('Borys')
else:
  print('Draw')

Solution (Python):
N, A, B = map(int, input().split())
 
if (B - A - 1) % 2 == 0:
  print('Borys')
else:
  print('Alice')

Solution (Python):
n,a,b=map(int,input().split())
print("ABloircyes"[(b-a)%2::2])

Solution (Python):
N,A,B=map(int,input().split())
if (B-A)%2==0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
n, a, b = map(int, input().split())

if (b - a) % 2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
N, A, B = map(int,input().split())
if (B - A) % 2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N, A, B = [int(i) for i in input().split()]

print(["Alice", "Borys"][(B - A) % 2])

Solution (Python):
N,A,B=map(int,input().split())
print('Alice') if (B-A)%2==0 else print('Borys')

Solution (Python):
n, a, b = map(int, input().split())
if (b - a) % 2 == 0:
	print("Alice")
else:
	print("Borys")

Solution (Python):
N,A,B = map(int,input().split(" "))
print(['Alice','Borys'][(B-A)%2])

Solution (Python):

def main():
    n, a, b = list(map(int, input().split()))

    if (b-a-1)%2 == 0:
        print('Borys')
    else:
        print('Alice')


if __name__ == '__main__':
    main()

Solution (Python):
N, A, B = map(int, input().split())

print("Alice" if (B - A) % 2 == 0 else "Borys")

Solution (Python):
n,a,b=map(int,input().split())
print('Borys'if(b-a)%2==1else'Alice')

Solution (Python):
n,a,b = map(int, input().split())

if (b-a)%2==1:
    print('Borys')
else:
    print('Alice')

Solution (Python):
n, a, b = map(int, input().split())
c = abs(a-b)
if c % 2 == 0:
    ans = "Alice"
else:
    ans = "Borys"
print(ans)

Solution (Python):
n, a, b = list(map(int, input().split()))
print("Alice" if (b - a) % 2 == 0 else "Borys")

Solution (Python):
n,a,b=map(int,input().split())
if (b - a) % 2 == 0:
  print('Alice')
else:
  print('Borys')

Solution (Python):
n,a,b=map(int,input().split())
print("Alice" if (b-a)%2==0 else "Borys")

Solution (Python):
N,A,B = map(int, input().split())
D = B - A

if D % 2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N,A,B = map(int, input().split())

if A % 2 == 0 and B % 2 == 0:
    print("Alice")
elif A % 2 == 0 and B % 2 != 0:
    print("Borys")
elif A % 2 != 0 and B % 2 == 0:
    print("Borys")
elif A % 2 != 0 and B % 2 != 0:
    print("Alice")

Solution (Python):
n,a,b=map(int,input().split())
if (b-a-1)%2==0:
  print('Borys')
else:
  print('Alice')

Solution (Python):
N,A,B = (int(x) for x in input().split())

if (B-A)%2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N, A, B = map(int, input().split())
while True:
  if abs(B-A)%2 == 1:
    print("Borys")
    break
  elif abs(B-A)%2 == 0:
    print("Alice")
    break

Solution (Python):
import sys,collections as cl
Max = sys.maxsize
def l():
	return list(map(int,input().split()))
def m():
	return map(int,input().split())
def s(x):
	a = []
	aa = x[i]
	su = 1
	for i in range(len(x)-1):
		if aa == x[i+1]:
			a.append([aa,su])
			aa = x[i+1]
			su = 1
		else:
			su += 1
	a.append([aa,su])
	return a
def jo(x):
	return " ".join(map(str,x))

n,a,b = m()

k = abs(a-b)
if k == 1:
	print("Borys")
else:
	if k % 2 == 0:
		print("Alice")
	else:
		print("Borys")

Solution (Python):
n,a,b = map(int, input().split(" "))

if (b - a) % 2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N,A,B = list(map(int, input().split()))

if (B-A)%2:
  print('Borys')
else:
  print('Alice')

Solution (Python):
n, a, b = list(map(int, input().split()))
if (b - a) % 2:
    print('Borys')
else:
    print('Alice')

Solution (Python):
n, a, b = map(int, input().split())
if (a-b) % 2 == 0:
  print('Alice')
else:
  print('Borys')

Solution (Python):
N, A, B = map(int, input().split())


diff = abs(A - B)
if diff % 2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
N, A, B = map(int, input().split(" "))
if (B - A) % 2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
n,a,b = map(int,input().split())

if abs(a-b) % 2:
  print("Borys")
else:
  print("Alice")

Solution (Python):
n,a,b = (int(i) for i in input().split())
if (b-a)%2==0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
n,a,b=map(int,input().split())
m=[999]+[0 for i in range(n)]+[999]
m[a]=1
m[b]=2
cnt=0
while 1:
    if cnt%2==0:
        if m[a+1]==0:
            m[a]=0
            m[a+1]=1
            a+=1
        elif m[a-1]==0:
            m[a]=0
            m[a-1]=1
            a-=1
        else:
            print('Borys')
            exit()
    else:
        if m[b-1]==0:
            m[b]=0
            m[b-1]=1
            b-=1
        elif m[b+1]==0:
            m[b]=0
            m[b+1]=1
            b+=1
        else:
            print('Alice')
            exit()

    cnt+=1

Solution (Python):
def main():
    N, A, B = list(map(int, input().split()))

    delta = abs(A-B) -1

    if delta%2:
        print("Alice")
    else:
        print("Borys")

main()

Solution (Python):
N,A,B = map(int,input().split())
n = B-A-1
if(n%2 == 1): print('Alice')
else: print('Borys')

Solution (Python):
import sys
input = sys.stdin.readline

N, A, B = map(int, input().split())
print("Alice" if (B-A+1)%2 == 1 else "Borys")

Solution (Python):
N, A, B = map(int, input().split())

if (B - A) % 2 == 0 :
    print('Alice')
else :
    print('Borys')

Solution (Python):
N, A, B = map(int, input().split())

if (B - A) % 2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
n, a, b = map(int, input().split())
print("Borys" if (b-a)%2 else "Alice")

Solution (Python):
N, A, B = map(int, input().split())
if (A+B) % 2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
N, A, B = map(int, input().split())
print(["Alice","Borys"][(B-A)%2!=0])

Solution (Python):
N,A,B = map(int, input().split())
if (B-A)%2==0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N,A,B = map(int, input().split())
if (B-A)%2==0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N,A,B = map(int, input().split())
if (B-A)%2==0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N,A,B = map(int,input().split())
if (A-B)%2:
  print("Borys")
else:
  print("Alice")

Solution (Python):
n, a, b = map(int, input().split())
if n == 2:
    win = 'Borys'
else:
    if abs(a - b) % 2 == 0:
        win = 'Alice'
    else:
        win = 'Borys'

print(win)

Solution (Python):
N,A,B=map(int,input().split())
num=abs(A-B)+1
if num%2==1:
    print('Alice')
else:
    print('Borys')

Solution (Python):
n,a,b=map(int,input().split())
if((b-a)%2==0):
  print("Alice")
else:
  print("Borys")

Solution (Python):
n,a,b=map(int,input().split());print('ABloircyes'[(b-a)%2==1::2])

Solution (Python):
n,a,b = map(int,input().split())
print('Alice') if (a-b)%2==0 else print('Borys')

Solution (Python):
N, A, B = map(int, input().split())
d = abs(A - B) - 1
if d % 2 == 0:
    print("Borys")
else:
    print("Alice")

Solution (Python):
n, a, b = map(int, input().split())
aida = b-a-1
if aida%2==0:
  print("Borys")
else:
  print("Alice")

Solution (Python):
n,a,b = map(int,input().split())
M = [1]+[0]*n+[1]
a -= 1
b -= 1
M[a] = 1
M[b] = 1
turn = 1
while True:
    if turn == 1:
        if M[a+1] == 1 and M[a-1] == 0:
            M[a-1] = 1
            M[a] = 0
            a -= 1
            turn *= -1
        elif M[a-1] == 1 and M[a+1] == 0:
            M[a+1] = 1
            M[a] = 0
            a += 1
            turn *= -1
        elif M[a-1] == 0 and M[a+1] == 0:
            M[a+1] = 1
            M[a] = 0
            a += 1
            turn *= -1
        else:
            print("Borys")
            exit()
    else:
        if M[b+1] == 1 and M[b-1] == 0:
            M[b-1] = 1
            M[b] = 0
            b -= 1
            turn *= -1
        elif M[b-1] == 1 and M[b+1] == 0:
            M[b+1] = 1
            M[b] = 0
            b += 1
            turn *= -1
        elif M[b-1] == 0 and M[b+1] == 0:
            M[b-1] = 1
            M[b] = 0
            b -= 1
            turn *= -1
        else:
            print("Alice")
            exit()

Solution (Python):
N, A, B = list(map(int, input().split()))

if abs(A - B) % 2 == 0:
  print("Alice")
else:
  print("Borys")

Solution (Python):
_, A, B = map(int, input().split())
if (A + B) % 2 == 0:
  print('Alice')
else:
  print('Borys')

Solution (Python):
N,A,B = map(int,input().split())

sub = B-A-1
ans = ''
if sub%2==0:
    ans = 'Borys'
else:
    ans = 'Alice'
    
print(ans)

Solution (Python):


import itertools
import collections
import bisect
import sys
input = sys.stdin.readline

def main():
    N, A, B = map(int, input().split())

    diff = B - A
    if diff % 2 == 1:
        print("Borys")
    else:
        print("Alice")


if __name__ == '__main__':
    main()

Solution (Python):
N, A, B = map(int, input().split())

if (abs(A - B) + 1) % 2 == 0:
    print('Borys')
else:
    print('Alice')

Solution (Python):
n, a, b = map(int, input().split())

if n == 2:
    print("Borys")
elif (b - a) % 2 == 0:
    print("Alice")
elif (b - a) % 2 == 1:
    print("Borys")

Solution (Python):
n,a,b=map(int,input().split())

if (b-a)%2==1:
    print("Borys")
else:
    print("Alice")

Solution (Python):
n,a,b = map(int,input().split())
if (b-a)%2!=0:
    print("Borys")
else:
    print("Alice")

Solution (Python):
n, a, b = map(int, input().split())
if (b-a)%2:
  print("Borys")
else:
  print("Alice")

Solution (Python):
N, A, B = map(int, input().split())
blocks_between_AB = B-A-1

if blocks_between_AB%2 == 0:
    winner = "Borys"
else:
    winner = "Alice"

print(winner)

Solution (Python):
N, A, B = map(int, input().split())
dist_AB = B-A-1

if dist_AB%2 == 0:
    winner = "Borys"
else:
    winner = "Alice"

print(winner)

Solution (Python):
s=input().split()
if int(s[2])-int(s[1])==1:
    print('Borys')
elif (int(s[2])-int(s[1]))%2==0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
a,b,c=map(int,input().split());print("ABloircyes"[(c-b)%2::2])

Solution (Python):
N,A,B=map(int,input().split())
print("Alice" if (B-A)%2==0 else "Borys")

Solution (Python):
N, A, B = map(int, input().split())
print('Alice' if (B - A) % 2 == 0 else 'Borys')

Solution (Python):



def main():
    n, a, b = map(int, input().split())

    if (b - a - 1) % 2 == 1:
        print('Alice')
    else:
        print('Borys')


if __name__ == '__main__':
    main()

Solution (Python):



def main():
    n, a, b = map(int, input().split())

    if (b - a - 1) % 2 == 1:
        print('Alice')
    else:
        print('Borys')


if __name__ == '__main__':
    main()

Solution (Python):
n, a, b = map(int, input().split())

if abs(a-b) % 2 == 0:
  print('Alice')
else:
  print('Borys')

Solution (Python):
N,A,B = map(int,input().split())

if A==B :
    if N == 1 :
        ans = "Borys"
    else :
        ans = "Alice"
else :
    if (B-A)% 2 == 0 :
        ans = "Alice"
    else :
        ans = "Borys"
print(ans)

Solution (Python):
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**6) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

n,a,b = li()

print("Alice" if abs(b-a)%2 == 0 else "Borys")

Solution (Python):
N,A,B = map(int,input().split())
d = B-A
print('Borys' if d%2 else 'Alice')

Solution (Python):
N, A, B = map(int, input().split())
if abs(A - B) % 2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
n, a, b = map(int,input().split())

if((b-a) % 2 == 0):
    print("Alice")
else:
    print("Borys")

Solution (Python):
n, a, b = map(int, input().split())
print('Alice') if (b - a) % 2 == 0 else print('Borys')

Solution (Python):
N,A,B = map(int,input().split())

if A - N == 0:
    print('Borys')
elif abs(A-B) % 2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
N,A,B = map(int, input().split())
if (B-A-1) % 2:
    print('Alice')
else:
    print('Borys')

Solution (Python):
n,a,b = map(int,input().split())

if abs(b-a)%2==1:
  print("Borys")
else:
  print("Alice")

Solution (Python):
N, A, B = map(int, input().split())

if (B-A)%2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N, A, B = map(int, input().split())
print('Alice' if (B - A) % 2 == 0 else 'Borys')

Solution (Python):
n,a,b = map(int,input().split())
if (b - a) % 2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
n, a, b = map(int, input().split())
print('Alice' if (b - a) % 2 == 0 else 'Borys')

Solution (Python):
n, a, b = map(int, input().split())
if (b - a - 1) % 2 == 0:
    ans = 'Borys'
else:
    ans = 'Alice'
print(ans)

Solution (Python):
n,a,b = (int(i) for i in input().split())
print('Borys' if (b-a)%2 else 'Alice')

Solution (Python):
N,A,B = map(int,input().split())

if (B-A)%2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
N, A, B = map(int, input().split())
if (B-A)%2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
n, a, b = map(int, input().split())
if (b - a + 1) % 2:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N, A, B = map(int, input().split())
det = (B-A)%2
if det == 1:
    print('Borys')
else:
    print('Alice')

Solution (Python):
n,a,b=map(int,input().split())
if (b-a)%2==1:
  print("Borys")
elif (b-a)%2==0: 
  print("Alice")
else:
  print("Draw")

Solution (Python):
n, a, b=map(int,input().split())
print("Alice" if (a - b -1) % 2 else"Borys")

Solution (Python):
N, A, B = map(int, input().split())

alice = A 
bolice = B
while True:
    if alice + 1 != N + 1 and alice + 1 != bolice:
        alice += 1
    else:
        res = 'Borys'
        break

    if bolice - 1 != 0 and  bolice - 1 != alice:
        bolice -= 1
    else:
        res = 'Alice'
        break

print(res)

Solution (Python):
import collections
import itertools
import numpy as np
import sys
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N,A,B = IL()

if (B-A)%2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N, A, B = map(int, raw_input().split())
print "Alice" if (B-A)%2 == 0 else "Borys"

Solution (Python):
n,a,b =list(map(int,input().split()))
if(abs(a-b-1)%2==0):
  print("Borys")
elif(abs(a-b-1)%2==1):
  print("Alice")
else:
  print("Draw")

Solution (Python):
N,A,B = [int(i) for i in input().split()]

if abs(B-A)%2 != 0:
    print('Borys')
else:
    print('Alice')

Solution (Python):
n,a,b = map(int, input().split())
print('Alice' if (a-b) % 2 ==0 else 'Borys')

Solution (Python):
n, a, b = map(int, input().split())

if n == 2:
    print("Borys")
elif (b-a-1)%2 == 0:
    print("Borys")
else:
    print("Alice")

Solution (Python):
n,a,b = map(int,input().split())
c = b-a-1
if c % 2 == 0:
    print('Borys')
else:
    print('Alice')

Solution (Python):
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N, A, B] = [int(input_raw[0]), int(input_raw[1]), int(input_raw[2])]
    if (B- A - 1) % 2 == 1:
        print "Alice"
    else:
        print "Borys"


if __name__ == '__main__':
    main()

Solution (Python):
n,a,b=map(int,input().split())
print('Borys' if (b-a)%2 else 'Alice')

Solution (Python):
N, A, B = map(int, input().split(" "))

print(["Alice", "Borys"][(B-A)%2])

Solution (Python):
n, a, b = map(int, input().split())

if (b - a) % 2 == 0:
  ans = 'Alice'
else:
  ans = 'Borys'
print(ans)

Solution (Python):
def solve(N, A, B):
    d1 = A - 1
    d2 = B - A - 1
    d3 = N - B

    if d2 % 2 == 1:
        return "Alice"
    else:
        return "Borys"
        
        
        
        
        


if __name__ == "__main__":
    N, A, B = tuple(map(int, input().split(" ")))
    print(solve(N, A, B))

Solution (Python):
import time
n, a, b = map(int, input().split())
index=0
flag=1
start = time.time()
while True:
    if a == 1 and b == a+1 and index % 2 == 0:
        print("Borys")
        break
    elif b == n and b == a+1 and index % 2 == 1:
        print("Alice")
        break
    if b == a+1:
        flag=0
    else:
        flag=1
    if flag:
        if index%2==0:
            a+=1
        else:
            b-=1
    else:
        if index%2==0:
            a-=1
        else:
            b+=1
    index+=1
    if time.time()-start > 1:
        print("Draw")
        break

Solution (Python):
a,b,c = map(int,input().split(" "))
if (c - b) % 2 == 0:
  print("Alice")
else:
  print("Borys")

Solution (Python):
n, a, b = map(int, input().split())
print('Borys' if ((b - a) % 2) else 'Alice')

Solution (Python):
import sys
n, a, b = map(int, input().split())
turn = 'Al'
while(True):
  if (turn == 'Al'): 
    if ((a == 1) & (b == 2)):
      print('Borys')
      sys.exit()
    elif (b - a == 1):
      a -= 1
    else:
      a += 1
    turn = 'Bo'
  else:
    if ((a == n - 1) & (b == n)):
      print('Alice')
      sys.exit()
    elif (b - a == 1):
      b += 1
    else:
      b -= 1
    turn = 'Al'

Solution (Python):
n, a, b = map(int, input().split())
if ((a - b) % 2 == 0):
  print("Alice")
else:
  print("Borys")

Solution (Python):
N, A, B = map(int, input().split())

if (abs(B-A)-1) % 2 == 1:
    print("Alice")
else:
    print("Borys")

Solution (Python):
n, a, b = list(map(int, input().split()))

ans = 'Borys' if (b - a) % 2 else 'Alice'

print(ans)

Solution (Python):


import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd 
from heapq import heappop, heappush, heapify, heappushpop
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from functools import reduce, partial
from fractions import Fraction
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def ceil(a, b=1): return int(-(-a // b))
def round(x): return int((x*2+1) // 2)
def fermat(x, y, MOD): return x * pow(y, MOD-2, MOD) % MOD
def lcm(x, y): return (x * y) // gcd(x, y)
def lcm_list(nums): return reduce(lcm, nums, initial=1)
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N, A, B = MAP()

if abs(A - B) % 2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
n, a, b = list(map(int,input().split()))
if (b-a+1)%2:
    print("Alice")
else:
    print("Borys")

Solution (Python):
n, a, b = map(int, input().split())
if abs(a - b) % 2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
N, A, B = map(int, input().split(" "))
distance = abs(A-B) - 1

if distance % 2 == 0:
    print("Borys")
else:
    print("Alice")

Solution (Python):
n, a, b = map(int, input().split())
print('Alice' if (b - a) % 2 == 0 else 'Borys')

Solution (Python):
n, a, b = map(int, input().split())
if (b - a) % 2 == 0:
    print('Alice')
else:
    print('Borys')

Solution (Python):
n,a,b=map(int,input().split())

if((b-a)%2==1):
    print("Borys")
else:
    print("Alice")

Solution (Python):
n,a,b = (int(i) for i in input().split())
if (b-a)%2 == 0:
  print('Alice')
else:
  print('Borys')

Solution (Python):
a,b,c=map(int,input().split())
print("Alice"if abs(b-c)%2!=1else"Borys")

Solution (Python):
N,a,b=map(int, input().split())
if (b-a)%2!=0:
    print("Borys")
else:
    print("Alice")

Solution (Python):
def inpl(): return list(map(int, input().split()))
m, a, b = inpl()
print(['Alice','Borys'][(a+b)%2])

Solution (Python):
N,A,B = map(int,input().split())
print('Alice' if (B-A)%2 == 0 else 'Borys')

Solution (Python):
N, A, B=map(int,input().split())
print("Borys" if (B-A)%2 else "Alice" )

Solution (Python):
N, A, B = map(int, input().split())

print('Borys' if (B - A + 1) % 2 == 0 else 'Alice')

Solution (Python):
N, A, B = list(map(int, input().split()))
if (B-A)%2==0:
    print('Alice')
else:
    print('Borys')