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



Sample input:
5 2 4


Sample output:
Alice

Submission status: Wrong Answer

Solution code:
def getinputdata():

    array_result = []
    
    data = input()
    
    array_result.append(data.split(" "))

    flg = 1

    try:

        while flg:

            data = input()

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:

        return array_result

arr_data = getinputdata()

#ますの数
n = int(arr_data[0][0])
#アリスの駒はマスの位置
a = int(arr_data[0][1])
#ボリスの駒は別のマスの位置
b = int(arr_data[0][2])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N, A, B=map(int,input().split())
import sys
for i in range (1,1000000):
    if i%2==1:
        if A+1!=B:
            A+=1
        elif A!=1:
            A-=1
        else:
            print ('Borys')
            sys.exit()
            
    if i%2==0:
        if B-1!=A:
            B-=1
        elif B!=5:
            B+=1
        else:
            print('Alice')
            sys.exit()

Submission status: Wrong Answer

Solution code:
def lii():
    return list(map(int, input().split(' ')))
  
N, A, B = lii()
if A == 1 and B == 2: print('Alice')
elif A == N-1 and B == N: print('Borys')
elif (B - A) % 2 == 0: print('Alice')
else: print('Borys')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    N,A,B = map(int,input().split(" "))
    if N==2:
        print("Draw")
        exit()
    s = abs(A-B)-1
    if s%2:
        print("Alice")
    else:
        print("Borys")

if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
n, a, b = [int(i) for i in input().split()]
print(["Alice", "Boris"][(a - b) % 2])

Submission status: Wrong Answer

Solution code:
import sys
tokens = sys.stdin.readline().strip().split()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
tokens = sys.stdin.readline().strip().split()

n = int(tokens[0])
a = int(tokens[1])
b = int(tokens[2])
print (b-a) % 2

Submission status: Wrong Answer

Solution code:
import sys
tokens = sys.stdin.readline().strip().split()

n = int(tokens[0])
a = int(tokens[1])
b = int(tokens[2])


def winner(n,a,b, move):
  print n,a,b, move
  # Base case
  if (n == 2):
    if move == "Alice":
      return "Borys"
    else:
      return "Alice"
  else:
    # consider move right
    if move == "Alice":
      wr = None
      wl = None
      if a < b-1: # can move right
        wr = winner(n-a, 1, b-1, "Borys")
      if a > 1: # can move left
        wl = winner(n, a-1, b, "Borys")
      if wr == None and wl == None:
        return "Borys"
      if wl == "Alice" or wr == "Alice":
        return "Alice"
      else:
        return "Borys"
    elif move == "Borys":
      wl = None
      wr = None
      if b < n: # can move right
        wr = winner(n, a, b+1, "Alice")
      if b > a+1: # can move left
        wl = winner(b-1, a, b-1, "Alice")
      if wr == None and wl == None:
        return "Alice"     
      if wl == "Borys" or wr == "Borys":
        return "Borys"
      else:
        return "Alice"
      
      
print winner(n,a,b, "Alice")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N, A, B = map(int, input().split())
four = [4**1, 4**2, 4**3]
if A==1 and B==N:
    print('Borys')
else:
    if B-A in four:
        print('Draw')
    elif (B-A)%2 == 0:
        print('Alice')
    else:
        print('Borys')

Submission status: Wrong Answer

Solution code:
N, A, B = map(int, input().split())
if A==1 and B==N:
    print('Borys')
else:
    if B-A >= 8:
        print('Draw')
    elif (B-A)%2 == 0:
        print('Alice')
    else:
        print('Borys')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
nums  = [int(i) for i in input().split()]
point = nums[0]
alice = nums[1]
borys = nums[2]

if borys - alice == 1:
    print("Borys")
elif borys - alice == 2:
    print("Alice")
elif borys - alice > 2 and (borys - alice) % 2 == 1:
    print("Alice")
elif borys - alice > 2 and(borys - alice) % 2 == 0:
    print("Borys")

Submission status: Wrong Answer

Solution code:
nums  = [int(i) for i in input().split()]
point = nums[0]
alice = nums[1]
borys = nums[2]

if borys - alice <= 2:
    print("Borys")
elif borys - alice > 2 and (borys - alice) % 2 == 1:
    print("Alice")
elif borys - alice > 2 and(borys - alice) % 2 == 0:
    print("Borys")

Submission status: Wrong Answer

Solution code:
n,a,b = map(int, input().split())
cnt = 0
if b-a == 1:
   print("Borys")

while b-a ==2:
   cnt += 1
   if cnt%2==1:
      a += 1
   else:
      b -= 1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# in  5, Alice  2, left  1, Borys  4, right  1, between  1 => Arice win
# in 53, Alice 23, left 22, Borys 42, right 16, between 18 => Borys win
# in  2, Alice  1, left  0, Borys  2, right  0, between  0 => Borys win

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

print N, A, B

# 'Alice'
# 'Borys'
# 'Draw'

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

Submission status: Wrong Answer

Solution code:
N_A_B = list(map(int, input().split()))

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

Submission status: Wrong Answer

Solution code:
N_A_B = list(map(int, input().split()))

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

Submission status: Wrong Answer

Solution code:
n, a, b = map(int, input().split())
turn = 0
while True: 
  if turn == 0:
    if a + 1 < b:
      a += 1
      print('a', a)
    elif 0 < a :
      a -= 1
      print('a', a)
    else:
      break
    turn = 1
  elif turn == 1:
    if a + 1 < b:
      b -= 1
      print('b', b)
    elif a + 1 == b and b != n:
      b += 1
      print('b', b)
    else:
      break
    turn = 0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

l=int(A-1)
r=int(N-B)
m=float((B-A-1)/2)

if l+m>r:
    print('Alice')
elif l+m==r:
    print('Borys')
else:
    print('Draw')

Submission status: Wrong Answer

Solution code:
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

        print(A, B)

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

        print(A, B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:


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

Submission status: Wrong Answer

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

Submission status: Time Limit Exceeded

Solution code:
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 B!=A+1:
    B=B-1
  else:
    B=B+1
  turn+=1
if A==1:
  print('Borys')
else:
  print('Alice')

Submission status: Time Limit Exceeded

Solution code:
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 B!=A+1:
    B=B-1
  else:
    B=B+1
  turn+=1
if A==1:
  print('Borys')
else:
  print('Alice')

Submission status: Time Limit Exceeded

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

while 1:
        if A + 1 != B:
                A += 1
        elif A - 1 != 0:
                A -= 1
        else:
                print("Borys")
                break
    
        if B - 1 != A:
                B -= 1
        elif B + 1 != N:
                B += 1
        else:
                print("Alice")
                break

Submission status: Time Limit Exceeded

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

turn = 1
while abs(a-b) != 1:  
  if turn == 1:
    if a<b:
      if (b-a)%2==0 or a==1: a += 1
      else: a -=1
    else:
      if (a-b)%2==0 or a==n: a -= 1
      else: a +=1
  else:
    if a<b:
      if (b-a)%2==1 or b==1: b += 1
      else: b -=1
    else:
      if (a-b)%2==1 or b==n: b -= 1
      else: b +=1
  turn *= -1
print('Alice' if turn==-1 else 'Borys')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())
d = max(a, b) - min(a, b) - 1
if d & 1:
    print("Alice")
else:
    print("Borys")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

d=abs(B-A)

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,a,b = map(int,input().split())
cnt = 1
while True:
  if cnt % 2 != 0: #alice
    cnt += 1
    a += 1
    if a == b:
      print('Borys')
      break
  else:
    cnt += 1
    b -= 1
    if b == a:
      print('Alice')
      break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# vim: fileencoding=utf-8


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n,a,b=map(int,input().split())
delta=b-a

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

diff = b-a

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

print(ans)

Submission status: Accepted

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

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

if __name__ == "__main__":
        solve()

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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])
	#print(res)

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n, a, b = map(int, input().split())
if (b - a) % 2 == 0:
    print("Alice")
else:
    print("Borys")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# AGC207A

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

n, a, b = map(int, input().split())
#f(5, 2, 4)
#f(2, 1, 2)
#f(58, 23, 42)
f(n, a, b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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