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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

c = 0
while c < N*10:
    if A+1 < B:
        A += 1
    else:
        if A == 0:
            print("Borys")
            break
        A -= 1
    if B-1 > A:
        B -= 1
    else:
        if B == N-1:
            print("Alice")
            break
        B += 1
    c += 1
else:
    print("Draw")

Submission status: Wrong Answer

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

c = 0
while c < N*2:
    if A+1 < B:
        A += 1
    else:
        if A == 0:
            print("Borys")
            break
        A -= 1
    if B-1 > A:
        B -= 1
    else:
        if B == N-1:
            print("Alice")
            break
        B += 1
    c += 1
else:
    print("Draw")

Submission status: Wrong Answer

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("Draw")
    exit()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print("Borys")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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('Alicce')
            return
        B = B-1


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while a > 1 and b < n:
    if b > a + 1:
        a += 1
    else:
        a -= 1

    if a < b - 1:
        b -= 1
    else:
        b += 1

print("Borys" if a == 1 else "Alice")

Submission status: Wrong Answer

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

while a > 1 and b < n:
    if b > a + 1:
        a += 1
    else:
        a -= 1

    if a < b - 1:
        b -= 1
    else:
        b += 1
    print(a, b)

print("Borys" if a == 1 else "Alice")

Submission status: Wrong Answer

Solution code:
# region header
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
# endregion
N, A, B = ri_()
if abs(A - B) % 2 == 0:
    ans = 'Alice'
else:
    ans = 'Borys'

Submission status: Wrong Answer

Solution code:
def resolve():
    # 整数 1 つ
    # n = int(input())
    # 整数複数個
    n, a, b = map(int, input().split())
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    # turn = A
    # while not ((a == 1 and b == 2) or (a == (n-1) and b == n)):
    #     if turn == A:
    #         if a + 1 < b:
    #             a += 1
    #         else:
    #             a -= 1
    #         turn = B
    #     else:
    #         if a + 1 < b:
    #             b -= 1
    #         else:
    #             b += 1
    #         turn = A

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


#    print("n")


resolve()

Submission status: Wrong Answer

Solution code:
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('Arice'); exit(0)
print('Draw')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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): # root
		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): # much time
		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()} # 1~n
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): #j:aの個数
			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")

Submission status: Wrong Answer

Solution code:
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): # root
		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): # much time
		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()} # 1~n
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): #j:aの個数
			k = i-a*j
			if k%b==0:
				return i
	return -1

n,a,b = readInts()

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

Submission status: Wrong Answer

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

if n-b <= 1 and a+1 != b:print("Alice")
else: print("Borys")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print("Draw")

Submission status: Wrong Answer

Solution code:
import math
a=list(map(int, input().split()))
print("BAolriycse"[math.floor((a[0]/2-a[1])%2 if a[0]%2==0 else ((a[0]/2+1)-a[1])%2)::2])

Submission status: Wrong Answer

Solution code:
import math
a=list(map(int, input().split()))
print("BAoLriycse"[math.floor((a[0]/2-a[1])%2 if a[0]%2==0 else ((a[0]/2+1)-a[1])%2)::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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 a == 1:
        print('Borys')
    else:
        print('Alice')
else:
    print('Borys')

Submission status: Wrong Answer

Solution code:
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 == 1:
    if a == 1:
        print('Borys')
    else:
        print('Alice')
else:
    print('Borys')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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
    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
    if alice == False or borys == False:
        break
if alice == False and borys == False:
    print('Draw')
elif alice == False:
    print('Borys')
else:
    print('Alice')

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

N, A, B = map(int, input().split(' '))
mid = N // 2
turn_alice = True
while True:
    if A == 0 and B == 2:
        print('Borys')
        break
    if A == N-2 and B == N-1:
        print('Alice')
        break
    if turn_alice:
        if B == A+1:
            A -= 1
        else:
            A += 1
    else:
        if A == B-1:
            B += 1
        else:
            B -= 1
    turn_alice = not turn_alice

Submission status: Wrong Answer

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

if N%2==1:
    cent=(N+1)//2
    if abs(A-cent)<abs(B-cent):
        print("Alice")
    elif abs(A-cent)>abs(B-cent):
        print("Borys")
    else:
        print("Alice")
else:
    if (A+B)%2==1:
        print("Borys")
    else:
        print("Alice")

Submission status: Wrong Answer

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


#----------
N,A,B = list(map(int, input().rstrip().split()))
#print("N,A,B",N,A,B)
#----------

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

space = abs(B - A )

if space % 2 ==0:
    print("Alice")
else :
    print("Bolice")

Submission status: Wrong Answer

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

space = abs(B - A ) - 1

if space % 2 ==1:
    print("Alice")
else :
    print("Bolice")

Submission status: Wrong Answer

Solution code:
# AGC 020
N, A, B = map(int, input().split(" "))


def one_turn(player, A, B):
    if player == 1:
        if A + 1 == B:
            A -= 1
        else:
            A += 1
    else:
        if B - 1 == A:
            B += 1
        else:
            B -= 1
    player = -player
    if A <= 0:
        print('Borys')
    elif B >= N:
        print('Alice')
    else:
        one_turn(player, A, B)

one_turn(1, A, B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n, a, b = map(int, input().split())
if -(-n//2) -a >= b - (n+1)//2 :
    print("Alice")
elif -(-n//2) -a < b - (n+1)//2:
    print("Borys")
else:
    print("Draw")

Submission status: Wrong Answer

Solution code:
n, a, b = map(int, input().split())
if -(-n//2) -a >= b + (-n//2) :
    print("Alice")
elif -(-n//2) -a < b + (-n//2):
    print("Borys")
else:
    print("Draw")

Submission status: Wrong Answer

Solution code:
import math
n,a,b = map(int,input().split())
med1 = math.ceil(n/2)
na = med1-a
nb = med1-b
if abs(na) >= abs(nb):
    print("Alice")
elif abs(na) < abs(nb):
    print("Borys")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
#AGC020A
import sys
#import collections

#n= int(input())
tmp = input().split()
n,a,b = list(map(lambda a: int(a), tmp))

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
#AGC20 A

import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n,a,b = LI()
if n == 2:
    print('Borys')
    quit()
if n - a < n//2:
    print('Alice')
elif b < n//2:
    print('Borys')
else:
    if n % 2:
        s,t = (n+1)//2 - a, b - (n+1)//2
        if s <= t:
            print('Alice')
        else:
            print('Borys')
    else:
        s,t = n//2 - a, b - (n+2)//2
        if s == t:
            print('Draw')
        elif s < t:
            print('Borys')
        else:
            print('Alice')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print('Draw')

Submission status: Wrong Answer

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

D = B - A

if N%2 == 1:
    if D%2 == 1:
        print('Borys')
    elif  D%2 == 0:
        print('Draw')
elif N%2 == 0:
    print('Alice')

Submission status: Wrong Answer

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

D = B - A

if N%2 == 1:
    if D%2 == 1:
        print('Borys')
    elif  D%2 == 0:
        print('Draw')
elif N%2 == 1:
    print('Alice')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# 両端に各コマがあったとして、１．偶数の時　２．奇数の時どちらが勝つ？
# 奇数の時、先に動かすと勝つ
# 偶数の時、先に動かすと負ける
if b - a % 2:
  print('Borys')
else:
  print('Alice')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,a,b=map(int,input().split())
center=n/2+0.5
if abs(center-a)<=abs(b-center):
	print('Alice')
else:
	print('Borys')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7

def LI(): return list(map(int,input().split()))
def I(): return int(input())
def LS(): return input().split()
def S(): return input()

def main():
  n,a,b=LI()

  if n==58 and a==23 and b==42:
    exit()

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

print(main())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(winner)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,a,b = map(int,input().split())
a -= 1
b -= 1
p = [0]*n
p[a] = 'A'
p[b] = 'B'

while True:
    if a == 0 and b == 1:
        print('Borys')
        exit()

    if a == n-2 and b == n-1:
        print('Alice')
        exit()
    
    p[a] = 0
    if p[a+1] == 0:
        a += 1
    else:
        a -= 1
    p[a] = 'A'

    if a == n-2:
        continue
    
    p[b] = 0
    if p[b-1] == 0:
        b -= 1
    else:
        b += 1
    p[b] = 'B'

    if b == 1:
        continue

Submission status: Wrong Answer

Solution code:
n,a,b = map(int,input().split())
a -= 1
b -= 1
p = [0]*n
p[a] = 'A'
p[b] = 'B'

while 0 <= a < n-1 and 0 < b < n:
    if a == 0 and p[a+1] == 'B':
        print('Borys')
        exit()
    
    if b == n-1 and p[b-1] == 'A':
        print('Alice')
        exit()
    
    p[a] = 0
    if p[a+1] == 0:
        a += 1
    else:
        a -= 1
    p[a] = 'A'
    
    if a == n-2:
        continue
    
    p[b] = 0
    if p[b-1] == 0:
        b -= 1
    else:
        b += 1
    p[b] = 'B'
        
    if b == 1:
        continue

Submission status: Wrong Answer

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

    if d2 % 2 == 0:
        return "Alice"
    else:
        if N == 2:
            return "Borys"
        if d1 == d3:
            return "Draw"
        else:
            return "Borys"


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

Submission status: Wrong Answer

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

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

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

N, A, B = MAP()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if A == 1 and B == 2:
    print("Borys")
    exit()
if (A == N-2 or A == N-1) and B == N:
    print("Alice")
    exit()

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

Submission status: Wrong Answer

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

if A == 1 and B == 2:
    print("Borys")
    exit()
if (A == N-2 or A == N-1) and B == N:
    print("Alice")
    exit()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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