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 (b-a)%2 == 0:
    print("Alice")
else:
    print("Borys")

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

Solution (Python):
import sys, math
from bisect import bisect_right
sys.setrecursionlimit(10**9)

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


def main():
    N, A, B = mi()
    if (A-B)%2:
        print("Borys")
    else:
        print("Alice")

if __name__ == "__main__":
    main()

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  = map(int, input().split())

for _ in range(n):
    if a < b:
        a += 1
        if a == b:
            print('Borys')
            exit()

    if b <= n:
        b += 1
    else:
        b -= 1
        if b == a:
            print('Alice')
            exit()
else:
    print('Draw')

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

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

Solution (Python):
n, a, b = map(int, input().split())
d = max(a, b) - min(a, b) - 1
if d & 1:
    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 (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 = abs(A-B)-1
if d%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())
print("Alice" if not (A-B)%2 else "Borys")

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

d=abs(B-A)

if d%2==0:
    ans="Alice"
else:
    ans="Borys"

print(ans)

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):
N,A,B = list(map(int,input().split()))

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

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())

dist = B - A
if dist % 2 == 0:
    ans = "Alice"
else:
    ans = "Borys"

print(ans)

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):
n,a,b=map(int,input().split())
if (b-a-1)%2==1:
    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())
cnt = 1
while True:
  if cnt % 2 != 0: 
    cnt += 1
    a += 1
    if a == b:
      print('Borys')
      break
  else:
    cnt += 1
    b -= 1
    if b == a:
      print('Alice')
      break

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

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())
print("Borys" if (B - A) % 2 == 1 else "Alice")

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

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):
n,a,b=map(int,input().split())
delta=b-a

if delta%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"
if A % 2 == 0 and B % 2 == 1:
    ans = "Borys"
if A % 2 == 1 and B % 2 == 0:
    ans = "Borys"

print(ans)

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

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())
print('Alice' if abs(a-b) % 2 == 0 else 'Borys')

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())
if (B-A)%2:
    print("Borys")
else:
    print("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())
if abs(a-b)%2!=0:
  print("Borys")
else:
  print("Alice")

Solution (Python):
'''
Created on 2020/08/21

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  N,A,B=map(int,pin().split())
  t=B-A-1
  if t%2==0:
    print("Borys")
  else:
    print("Alice")
  return 
main()

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("Alice" if (B-A)%2==0 else "Borys")

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

diff = b-a

if diff%2 == 0:
    ans = 'Alice'
else:
    ans ='Borys'

print(ans)

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

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

if __name__ == "__main__":
        solve()

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

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

    print(ans)


if __name__ == "__main__":
    main()

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-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 = list(map(int, input().split()))
if (B-A-1)%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):
def main():
    N, A, B = 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(' '))
if (b - a - 1) % 2 == 0:
    print('Borys')
else:
    print('Alice')

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

Solution (Python):


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

if (b-a-1)%2 == 1:
    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):
import sys


inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instr = lambda: sys.stdin.readline()
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())

n, a, b = inintm()

if n == 2:
    print("Borys")
    exit()

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

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

if abs(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==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):
import sys

input = sys.stdin.readline


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

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

    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    n, a, b = map(int, input().split())
    if abs(a - b)&1:
        print('Borys')
    else:
        print('Alice')

if __name__ == '__main__':
    main()

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

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

def linput(ty=int, cvt=list):
	return cvt(map(ty,input().split()))

def vinput(rep=1, ty=int, cvt=list):
	return cvt(ty(input().rstrip()) for _ in "*"*rep)

def gcd(a: int, b: int):
	while b: a, b = b, a%b
	return a

def lcm(a: int, b: int):
	return a * b // gcd(a, b)

def main():
	n,a,b=linput()
	
	res = (b-a-1)%2
	
	sT = "Borys Alice".split()
	print(sT[res])
	

if __name__ == "__main__":
	main()

Solution (Python):
n, a, b = map(int, input().split(" "))
if a > b:
    diff = a - b - 1
else:
    diff = b - a - 1

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

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    n, a, b = map(int, readline().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())

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

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

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, open(0).read().split())
if (B-A) % 2 == 1:
    print('Borys')
else:
    print('Alice')

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

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

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

Solution (Python):


def f(n, a, b):
    if (b - a) % 2:
        print('Borys')
    else:
        print('Alice')

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



f(n, a, b)

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('Alice' if (b - a) % 2 == 0 else 'Borys')

Solution (Python):
import sys

def S(): return sys.stdin.readline().rstrip()

N,A,B = map(int,S().split())

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

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

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

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

Solution (Python):
n,a,b = map(int,input().split())
x = b-a-1
if x%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 (b - a) % 2 == 0:
  print('Alice')
else:
  print('Borys')

Solution (Python):
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

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


if __name__ == '__main__':
    main()

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

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

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

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

if diff%2 ==0:
    print('Alice')
elif diff%2 !=0:
    print('Borys')
else:
    print('Draw')

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())
if a>b:
  if (a-b)%2==0:
    print("Alice")
  else:
    print("Borys")
elif a<b:
  if (b-a)%2==0:
    print("Alice")
  else:
    print("Borys")

Solution (Python):
n,a,b=map(int,input().split())
print("Borys"if (b-a)%2else "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())
print("Alice" if (B-A)%2==0 else "Borys")

Solution (Python):

from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right

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 (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):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N, A, B = map(int, read().split())

if (A-B) & 1:
    print('Borys')
else:
    print('Alice')

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

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):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
from decimal import *

N, A, B = MAP()

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
from decimal import *

N, A, B = MAP()

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

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

Solution (Python):
N, A, B = [int(x) for x in input().split()]
if abs(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 = 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())
ans = 'Borys' if (B - A) % 2 else 'Alice'
print(ans)

Solution (Python):
n,a,b=map(int,input().split())
x=b-a-1
if x%2==0:
    print('Borys')
else:
    print('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 (A - B)%2  == 0:
  print('Alice')
else:
  print('Borys')

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 (b-a)%2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, A, B = MAP()

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

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    N, A ,B = map(int, input().split())
    if abs(A - B) % 2 == 1: print("Borys")
    else: print("Alice")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()
 
n, a, b = map(int, input().split())

c = b - a

if c % 2 == 1:
    print("Borys")
else:
    print("Alice")

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 (b-a-1)%2 == 1:
    print('Alice')
else:
    print('Borys')

Solution (Python):
from sys import stdin
def main():
    
    readline=stdin.readline
    n,a,b=map(int,readline().split())
    print("Alice" if (b-a)%2==0 else "Borys")

if __name__=="__main__":
    main()

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

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

Solution (Python):






from collections import defaultdict











import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
n,a,b = readInts()
ab = b-a
if ab%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):
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())
d = b - a
print('Alice' if d % 2 == 0 else 'Borys')

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

if a == 1 and b == 2:
    print('Borys')
elif a == n and b == n-1:
    print('Borys')
elif a < b:
    if (b-a) % 2:
        print('Borys')
    else:
        print('Alice')
elif a > b:
    if (a-b) % 2:
        print('Alice')
    else:
        print('Borys')

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()


def DD(arg): return defaultdict(arg)



def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count




N,A,B = IL()

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

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

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

AB = B-A

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

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


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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    N, A, B = [int(x) for x in input().split()]

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

    
    
    

if __name__ == '__main__':
    main()

Solution (Python):
n, a, b = map(int, input().split())
if n == 2:
    print("Borys")
elif (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+1)%2==0:
  print("Borys")
else:
  print("Alice")

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

while True:
  if b-a>1:
    a+=1
  else:
    a-=1
  if a==0:
    print('Borys')
    break
  if b-a>1:
    b-=1
  else:
    b+=1
  if b==n+1:
    print('Alice')
    break

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

win = "Borys"
if abs(a-b) % 2 == 0:
    win = "Alice"

print(win)

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(x) for x in input().strip().split()]
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):
_,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-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())
d = abs(a-b)
if d%2 is 1:
    print('Borys')
else:
    print('Alice')

Solution (Python):

def main():
    N,A,B  = map(int, input().split()) 
    while True:
        if(A+1==B):
            print('Borys')
            return
        A = A+1
        if(B-1==A):
            print('Alice')
            return
        B = B-1


if __name__ == '__main__':
    main()

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

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

Solution (Python):
n, a, b = list(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('Alice')
else:
    print('Borys')

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

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

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

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

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    N, A, B = map(int, readline().split())
    diff = abs(A-B)
    if diff%2==0:
        print('Alice')
    else:
        print('Borys')

if __name__ == '__main__':
    main()