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())
turn = 0
while True: 
  if turn == 0:
    if a + 1 < b:
      a += 1
    elif 0 < a :
      a -= 1
    else:
      break
    turn = 1
  elif turn == 1:
    if a + 1 < b:
      b -= 1
    elif a + 1 == b and b != n:
      b += 1
    else:
      break
    turn = 0

if turn == 0:
  print('Borys')
else:
  print('Alice')

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

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

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

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

Solution (Python):
test=raw_input().split(" ")

a=int(test[0])
b=int(test[1])
c=int(test[2])

if b==1 and c==2:
    print("Borys")

else:
    if (b-c-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):



import sys

n, a, b = map(int, sys.stdin.readline().strip().split(" "))
if (b - a) % 2 == 0:
    print("Alice")
else:
    print("Borys")

Solution (Python):

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

Solution (Python):
import sys

N,A,B = map(int, sys.stdin.readline().split())
print('Alice' if abs(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):
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 ((N-A) - (N-B))%2 == 0:
    print("Alice")
else:
    print("Borys")

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

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

Solution (Python):

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

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

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

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

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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
def LI(): return [int(x) for x in input().split(" ")]
def LS(): return [str(x) for x in input().split(" ")]
def ItoS(L): return [str(x) for x in L]
def StoI(L): return [int(c) for c in L]

def solve():
    while 1:
        try:
            n, a, b = LI()
            if abs(a - b) % 2:
                print("Borys")
            else:
                print("Alice")

            break
        except:
            break
solve()

Solution (Python):
if __name__ == '__main__':
    
    N, A, B = [int(x) for x in input().split(' ')]
    
    while True:
        
        if (A+1) == B:
            if A == 1:
                print('Borys')
                break
            else:
                A -= 1
        else:
            A += 1

        if (B-1) == A:
            if B == N:
                print('Alice')
                break
            else:
                B += 1
        else:
            B -= 1

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

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

Solution (Python):
import numpy as np
import copy

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):
import math
N,A,B=[int(i) for i in raw_input().split()]
C=B-A
if C % 2 ==0:
     print("Alice")
else:
     print("Borys")

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

Solution (Python):
import sys,collections;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

n,a,b = Is()
if abs(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):


def main():
    temp=input().split(" ")
    n=int(temp[0])
    a=int(temp[1])
    b=int(temp[2])
    sa=abs(a-b)
    if sa%2==1:
        print("Borys")
    else:
        print("Alice")
if __name__ == '__main__':
    main()

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

Solution (Python):

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

ans = 0
for i in range(N):
    if A + 1 == B:
        ans = i % 2
        break
    if i % 2 == 0:
        A += 1
    else:
        B -= 1

print(('Borys', 'Alice')[ans])

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

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

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

Solution (Python):
import math
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("Borys")
else:
	print("Alice")

Solution (Python):
line = input().split(" ")
N = int(line[0])
A = int(line[1])
B = int(line[2])

x = B-A-1

if x%2==0:
    print("Borys")
elif x%2==1:
    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(x) for x in input().split())
dist = b - a - 1
if dist % 2 == 0:
    print('Borys')
else:
    print('Alice')

Solution (Python):




def slove(n, a, b):
    if (b - a) % 2 != 0:
        return "Borys"
    else:
        return "Alice"


if __name__ == "__main__":
    m = input().split(" ")
    n = int(m[0])
    a = int(m[1])
    b = int(m[2])

    print(slove(n, a, b))

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


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

solve()

Solution (Python):

n, a, b = map(int, input().split())
if a > b:
    a, b = b, a
    flipped = True
else:
    flipped = False
turn = 0
while True:
    if turn % 2 == 0:
        if a + 1 == b:
            if a == 1:
                break
            else:
                a -= 1
        else:
            a += 1
    else:
        if b - 1 == a:
            if b == n:
                break
            else:
                b += 1
        else:
            b -= 1
    turn += 1
if flipped:
    a, b = b, a
print(['Borys', 'Alice'][turn % 2])

Solution (Python):
[N,A,B]=map(int,raw_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):
if __name__ == '__main__':
    N, A, B = map(int, input().split())
    if (A - B) % 2 == 1:
        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 collections import Counter
import numpy as np
import sys


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

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

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



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

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

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=[int(i) for i in input().split()]
if (a - b)%2==0:
  print('Alice')
else:
  print('Borys')

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

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

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

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

Solution (Python):
N,A,B=input().split(' ')
if (int(B)-int(A)-1)%2==1:
  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):
import re
import math
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, raw_input().split())
print "Alice" if (B-A)%2==0 else "Borys"

Solution (Python):
import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache, reduce
from operator import xor
from heapq import heappush, heappop
INF = float("inf")
YES, NO, Yes, No = "YES", "NO", "Yes", "No"
sys.setrecursionlimit(10**7)


dy4, dx4 = [0, -1, 0, 1], [1, 0, -1, 0]


def inside(y: int, x: int, H: int, W: int) -> bool: return 0 <= y < H and 0 <= x < W
def ceil(a, b):return (a + b - 1) // b


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


def main():
    solve()


if __name__ == '__main__':
    main()

Solution (Python):





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

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

if __name__ == "__main__": main()

Solution (Python):








n, a, b = map(int, input().split())
ar = "Alice"
bo = "Borys"

if (b - a) % 2 == 0:
    print(ar)
else:
    print(bo)

Solution (Python):
n, a, b = [int(x) for x in input().split()]

if (a - b) % 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 = list(map(int, input().split()))

diff = abs(A - B)
if diff % 2 == 1:
    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())
print('Borys' if (b - a) & 1 else 'Alice')

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

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

else:
  print "Borys"

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    n,a,b = LI()
    if abs(a-b) % 2 == 1:
        return 'Borys'

    return 'Alice'

print(main())