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

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
INF = float('inf')
MOD = 10 ** 9 + 7
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rf(): return float(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
def rf_(): return [float(_) for _ in rs().split()]
def divisors(n, sortedresult=True):
    div = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            div.append(i)
            if i != n // i:
                div.append(n//i)
    if sortedresult:
        div.sort()
    return div

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

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

    
    
    
    
    
    
    
    
    
    
    
    
    
    

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





resolve()

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) % 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 = 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-1)%2==0:
	print('Borys')
	exit()
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())
for i in range(N):
    if(B != A + 1): A += 1
    elif(A != 0): A -= 1
    else: print('Borys'); exit(0)
    if(A != B - 1): B -= 1
    elif(B != N): B += 1
    else: print('Alice'); exit(0)
print('Draw')

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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

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


if __name__ == '__main__':
    resolve()

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

Solution (Python):


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

Solution (Python):
import math
import queue
from collections import defaultdict

def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def printQueue(q):
	r=qb
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
def dq():
	return queue.deque()
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): 
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): 
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} 
def bitArr(n):
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1
def maxValue(a,b,v):
	v2 = v
	for i in range(v2,-1,-1):
		for j in range(v2//a+1): 
			k = i-a*j
			if k%b==0:
				return i
	return -1

n,a,b = readInts()

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

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

diff = B - A - 1

if diff % 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):
import sys
def input(): return sys.stdin.readline().strip()

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

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

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 = 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())
if (B-A)%2 == 1:
  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):
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    N,A,B = list(map(int,_in[0].split(' ')))  
    
    TF = 'Alice' if (B-A)%2==0 else 'Borys'
    
    print(TF)

Solution (Python):
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    N,A,B = list(map(int,_in[0].split(' ')))  
    
    while True:
        if A+1 != B:
            A += 1
        else:
            TF = 'Borys'
            break
        if B-1 != A:
            B -= 1
        else:
            TF = 'Alice'
            break
    
    print(TF)

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 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 = 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) % 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())
print("Borys" if (b-a)%2 else "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())
print('Alice' if (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 (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):
import sys
N,A,B = map(int, input().split())

if B-A == 1:
    print("Borys")
    sys.exit()
elif ((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 b-a==0:
    print('Borys')
    exit()

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

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













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

Solution (Python):
from sys import stdin
import sys
import math

N, A, B = list(map(int, stdin.readline().rstrip().split()))


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

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

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

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

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

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):
a=list(input().split(" "))
x=int(a[1])
y=int(a[2])
 
if abs(x-y)%2==0:
  print("Alice")
else:
  print("Borys")

Solution (Python):
_,A,B=list(map(int,input().split()))
x=A+B
print("Alice" if x%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
def input(): return sys.stdin.readline().rstrip()
def main():
    n,a,b=map(int,input().split())
    if (b-a-1)%2:print("Alice")
    else:print("Borys")

if __name__=='__main__':
    main()

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    n,a,b=map(int,input().split())
    if (b-a-1)%2: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):
import sys

def main():
    N, A, B = map(int, input().split())
    print('Alice' if (abs(A-B)-1)%2 != 0 else 'Borys')
if __name__ == '__main__':
    main()

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

AliceWin = False
C = B - A - 1
if C % 2 == 1:
    AliceWin = True

if AliceWin:
    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, 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 abs(A-B)%2 == 0 else "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 = map(int, input().split())

diff = b - a

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

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

diff = b - a

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

Solution (Python):
N,A,B=map(int, input().split())
turn=0
while A!=1 and B!=N or turn==0:
  if A!=B-1:
    A+=1
  else:
      A=A-1
  if A<1:
      A=1
  if B!=A+1:
    B=B-1
  else:
    B=B+1
  if B>N:
      B=N
  turn+=1
if A==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("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 = map(int,input().split())
maxx = max(a,b)
minn = min(a,b)
bet = maxx - minn - 1
if bet % 2 == 0:
  print("Borys")
else:
  print("Alice")

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

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

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

Solution (Python):

def inputlist(): return [int(j) for j in input().split()]


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

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

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

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

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

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

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

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

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

Solution (Python):
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') 
def gcd(a,b):return fractions.gcd(a,b) 
def lcm(a,b):return (a*b) // fractions.gcd(a,b) 
def iin(): return int(sys.stdin.readline()) 
def ifn(): return float(sys.stdin.readline()) 
def isn(): return sys.stdin.readline().split() 
def imn(): return map(int, sys.stdin.readline().split()) 
def imnn(): return map(lambda x:int(x)-1, sys.stdin.readline().split()) 
def fmn(): return map(float, sys.stdin.readline().split()) 
def iln(): return list(map(int, sys.stdin.readline().split())) 
def iln_s(): return sorted(iln()) 
def iln_r(): return sorted(iln(), reverse=True) 
def fln(): return list(map(float, sys.stdin.readline().split())) 
def join(l, s=''): return s.join(l) 
def perm(l, n): return itertools.permutations(l, n) 
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) 
def comb(l, n): return itertools.combinations(l, n) 
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) 
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 
def m_add(a,b): return (a+b) % MOD
def print_list(l): print(*l, sep='\n')

def sieves_of_e(n):
    is_prime = [True] * (n+1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i * 2, n+1, i): is_prime[j] = False
    return is_prime

N,A,B = imn()

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):
def is_fin(x,y):
    if abs(x-y)==1:
        return False
    return True
n,a,b = map(int,input().split())
turn = 0
while is_fin(a,b):
    if turn%2==0:
        a += 1
    else:
        b -= 1
    turn += 1
print('Alice' if turn%2==1 else 'Borys')

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
x,y,z = list(map(int, input().split()))
k=y-z
if k%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())



for i in range(N):
  if A+1<B:
    A +=1
  else:
    A += -1
    if A <1:
      ans="Borys"
      break
  
    
  if A<B-1:
    B += -1
  else:
    B += 1
    if B >N:
      ans="Alice"
      break
  
else:
  ans="Draw"
  
print(ans)

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==1):
    print("Alice")
else:
    print("Borys")

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

t = 1
while True:
    if t==1:
        if a+1==b:
            if a==1:
                print("Borys")
                break
            else:
                a -= 1
        else:
            a += 1
    else:
        if b-1==a:
            if b==n:
                print("Alice")
                break
            else:
                b += 1
        else:
            b -= 1
    t += 1
    t %= 2

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

Solution (Python):

import sys


def solve(N: int, A: int, B: int):
    if (B-A)&1:
        print("Borys")
    else:
        print("Alice")
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    A = int(next(tokens))  
    B = int(next(tokens))  
    solve(N, A, B)

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

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

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

Diff = B - A
if Diff % 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):
def main():
    length, alice, borys = map(int, input().split())
    print("Alice" if (borys - alice) % 2 == 0 else "Borys")


if __name__ == '__main__':
    main()

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())
n_list = [0 for i in range(n)]
n_list[a-1] = 1
n_list[b-1] = 2
i = 0
a = a-1
b = b-1
alice = True
borys = True
while True:
    if n_list[a+1] == 0:
        n_list[a] = 0
        n_list[a+1] = 1
        a += 1
    else:
        if a-1 >= 0:
            n_list[a] = 0
            n_list[a-1] = 1
            a -= 1
        else:
            alice = False
            break
    if n_list[b-1] == 0:
        n_list[b] = 0
        n_list[b-1] = 2
        b -= 1
    else:
        if b+1 <= n-1:
            n_list[b] = 0
            n_list[b+1] = 2
            b += 1
        else:
            borys = False
            break
    if alice == False or borys == False:
        break
if alice == False:
    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:
    ans = "Alice"
else:
    ans = "Borys"
print(ans)

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 == 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):
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):
def main():
    N, A, B = (int(i) for i in input().split())
    if (B - A) % 2:
        print("Borys")
    else:
        print("Alice")


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

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

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

Solution (Python):
print('ABloircyes'[sum(map(int,input().split()[1:]))%2::2])

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

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





ans = ''
while True:
    if A + 1 == B:
        A -= 1
        if A == 0:
            ans = 'Borys'
            break
    else:
        A += 1

    if B - 1 == A:
        B += 1
        if B == N+1:
            ans = 'Alice'
            break
    else:
        B -= 1

print(ans)

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==1:
    print("Borys")
else:
    print("Alice")

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

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

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

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

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

Solution (Python):




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

num_between = abs(A-B) - 1
if (num_between % 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):
def main():
    N,A,B = map(int,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 (b-a+1) % 2:
    print('Alice')
else:
    print('Borys')

Solution (Python):
N, A, B = [int(x) for x in 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):
n, a, b = map(int, input().split())
dis = b - a - 1
if dis % 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):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
from functools import reduce
mod = 10 ** 9 + 7
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]




n,a,b=mii()

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

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