Problem:


Score : 100 points

Problem Statement

Snuke lives at position x on a number line.
On this line, there are two stores A and B, respectively at position a and b, that offer food for delivery.

Snuke decided to get food delivery from the closer of stores A and B.
Find out which store is closer to Snuke's residence.

Here, the distance between two points s and t on a number line is represented by |s-t|.

Constraints

1 \leq x \leq 1000

1 \leq a \leq 1000

1 \leq b \leq 1000

x, a and b are pairwise distinct.

The distances between Snuke's residence and stores A and B are different.

Input

Input is given from Standard Input in the following format:

x a b

Output

If store A is closer, print A; if store B is closer, print B.

Sample Input 1

5 2 7

Sample Output 1

B

The distances between Snuke's residence and stores A and B are 3 and 2, respectively.
Since store B is closer, print B.

Sample Input 2

1 999 1000

Sample Output 2

A



Sample input:
5 2 7


Sample output:
B

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b):
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:
x,a,b = map(int, raw_input().split())
if abs(x-a) < abs(x-b):
    print 'A'
else:
    print 'B'

Submission status: Accepted

Solution code:
#ABC071A

x,a,b=map(int,raw_input().split())
if abs(a-x)>=abs(b-x):
 print 'B'
else:
 print 'A'

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
if abs(a[0] - a[1]) > abs(a[0] - a[2]):
    print("B")
else:
  	print("A")

Submission status: Accepted

Solution code:
a,b,c=map(int,raw_input().split())
print "A" if abs(b-a)<=abs(c-a) else "B"

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
if max(x,a) - min(x,a) > max(x,b) - min(x,b):
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    X, A, B = [int(i) for i in input().split()]
    if abs(X - A) < abs(X - B):
        print('A')
    else:
        print('B')

Submission status: Accepted

Solution code:
myinput=input()
a=[int(x) for x in myinput.split()]
if abs(a[0]-a[1])<abs(a[0]-a[2]):
    print("A")
else:
    print("B")

Submission status: Accepted

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

if abs(x-a) > abs(x-b):
    print('B')
else:
    print('A')

Submission status: Accepted

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

x = lst[0]
a = lst[1]
b = lst[2]

if abs(b-x) > abs(a-x):
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
a=abs(x-a)
b=abs(x-b)
if a>b: print("B")
else: print("A")

Submission status: Accepted

Solution code:
def a():
    x, a, b = map(int, input().split())
    print('A' if abs(x-a) < abs(x-b) else 'B')

a()

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split(" "))
x_a = abs(x-a)
x_b = abs(x-b)
if min(x_a, x_b) ==  x_a:
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if (x-a)**2 > (x-b)**2:
  print("B")
else:
  print("A")

Submission status: Accepted

Solution code:

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


disA = abs(x-a)
disB = abs(x-b)

res = 'A' if disA<disB else 'B'
print(res)

Submission status: Accepted

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

if abs(x-a)<=abs(x-b):
    print 'A'
else:
    print 'B'

Submission status: Accepted

Solution code:
tmp=map(int, raw_input().split(" "))
a=abs(tmp[0]-tmp[1])
b=abs(tmp[0]-tmp[2])
if a<b:
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
a = map(int, raw_input().strip().split())
da = max(a[1],a[0])-min(a[1],a[0])
db = max(a[0],a[2])-min(a[0],a[2])
if da > db:
	print('B')
else:
	print('A')

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split(' '))
c = a-x
d = b-x

if c<0:
	e = -c
else:
	e = c

if d<0:
	f = -d
else:
	f = d


if e<f:
	print('A')
else:
	print('B')

Submission status: Accepted

Solution code:
x, A, B = map(int, input().split())
if abs(x - A) < abs(x - B):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x,a,b=list(map(int,input().split()))
if abs(x-a) > abs(x-b):
    print("B")
else:
    print("A")

Submission status: Accepted

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

dist_atox = abs(a-x)
dist_btox = abs(b-x)
y = dist_atox - dist_btox

print("A" if y < 0 else "B")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())		# 5 7 2


if abs(a-x) < abs(b-x):
	print("A")
else:
	print("B")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if x < a and x < b:
    if a < b:
        print("A")
    else:
        print("B")
elif x > a and x > b:
    if a > b:
        print("A")
    else:
        print("B")
else:
    if abs(x - a) < abs(x - b):
        print("A")
    else:
        print("B")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
if abs(x-a) < abs(x-b):
    print('A')
else :
    print('B')

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
if abs(x - a) < abs(x - b):
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
import sys

x, a, b = map(int, sys.stdin.readline().strip().split(" "))

if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Submission status: Accepted

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

if abs(x - a) < abs(x - b):
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
x,a,b=[int(x) for x in input().split()]
if abs(a-x) > abs(b-x):
	print("B")
else:
	print('A')

Submission status: Accepted

Solution code:
xab=(input()).split(' ')
print('A' if abs((int)(xab[0])-(int)(xab[1]))< abs((int)(xab[0])-(int)(xab[2]))else 'B')

Submission status: Accepted

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

ax_length = abs(location_list[0] - location_list[1])
bx_length = abs(location_list[0] - location_list[2])

if ax_length < bx_length:
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x,a,b = map(int,raw_input().split())
if abs(x-a) > abs(x-b):
    print "B"
else:
    print "A"

Submission status: Accepted

Solution code:
import math

x,a,b=list(map(int,input().split()))
if(math.fabs(x-a)>math.fabs(x-b)):
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
 
if abs(x-a) > abs(x-b):
  print("B")
else:
  print("A")

Submission status: Accepted

Solution code:
#from time import time
#t = time()
nvm = input().split(' ')
if abs(int(nvm[0]) - int(nvm[1])) < abs(int(nvm[0]) - int(nvm[2])):
    print('A')
else:
    print('B')

#print(mn[0] * mm[1])
#tt= time()
#print(tt-t)

Submission status: Accepted

Solution code:
import math


x = list(map(int, input().split()))

if(math.fabs(x[1]-x[0])-math.fabs(x[2]-x[0]) > 0):
    print('B')
    quit()
else:
    print('A')
    quit()


quit()

Submission status: Accepted

Solution code:
x,a,b=map(float,raw_input().split())
AX=abs(a-x)
BX=abs(b-x)
if AX>BX:
    print "B"
else:
    print "A"

Submission status: Accepted

Solution code:
x = map(int, raw_input().split())

place = x[0]
a     = x[1]
b     = x[2]

dist_a = abs(place - a)
dist_b = abs(place - b)

if dist_a < dist_b:
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x, a, b = map(int, raw_input().split())
print('A' if abs(x - a) < abs(x - b) else  'B')

Submission status: Accepted

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

    if abs(A - X) < abs(B - X):
        ans = 'A'
    else:
        ans = 'B'
    print(ans)

main()

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if (abs(a - x) < abs(b - x)):
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
x,a,b = (int(i) for i in input().split())

a = a-x if a>x else x-a
b = b-x if b>x else x-b

ans = "A" if a<b else "B"

print(ans)

Submission status: Accepted

Solution code:
#coding=UTF-8

mozir=input()
hyo=mozir.split(' ')
X=int(hyo[0])
A=int(hyo[1])
B=int(hyo[2])

A_Dist=abs(X-A)
B_Dist=abs(X-B)

if A_Dist > B_Dist :
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:
# coding: utf-8
x,a,b=map(int,input().split())
print('A' if abs(x-a)<abs(x-b) else 'B')

Submission status: Accepted

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

if abs(x - a) < abs (x - b):
    print "A"
else:
    print "B"

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(x-a)<abs(x-b): print("A")
else: print("B")

Submission status: Accepted

Solution code:
x, a, b = (int(i) for i in input().split())
if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Submission status: Accepted

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

if abs(x-a)<abs(x-b):
	print 'A'
else:
	print 'B'

Submission status: Accepted

Solution code:
x, a, b = (int(i) for i in input().split())
aa = abs(a-x)
bb = abs(b-x)
if aa > bb:
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]

x, a, b = read_line(int, int, int)

print('A' if abs(x - a) < abs(x - b) else 'B')

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
a = abs(l[0] - l[1])
b = abs(l[0] - l[2])

if a<b:
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
def A_MealDelivery(lst):
    x, a, b = lst[0], lst[1], lst[2]
    if abs(x - a) < abs(x - b):
        return 'A'
    else:
        return 'B'

l = [int(i) for i in input().split()]
print(A_MealDelivery(l))

Submission status: Accepted

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

if abs(x-a) > abs(x-b):
    print("B")
else:
    print("A")

Submission status: Accepted

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

dis_a = abs(x - a)
dis_b = abs(x - b)

if dis_a < dis_b:
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
disA = abs(x-a)
disB = abs(x-b)
if disA < disB:
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(x-a) < abs(x-b):
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
x, a, b = list(map(int, input().split(' ')))

if abs(a - x) < abs(b - x):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
def main():
    x, a, b = [int(i) for i in input().split()]

    if(abs(x-a) < abs(x-b)):
        print("A")
    else:
        print("B")
        
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    x, a, b = map(int, input().split())
    if abs(x - a) < abs(x - b):
        print("A")
    else:
        print("B")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

# sys.stdin = open('a1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    x, a, b = read_int_list()
    if abs(a - x) < abs(b - x):
        print('A')
    else:
        print('B')


main()

Submission status: Accepted

Solution code:
a = input().split()
if (max(int(a[0]), int(a[1])) - min(int(a[0]), int(a[1]))) > (max(int(a[0]), int(a[2])) - min(int(a[0]), int(a[2]))):
    print("B")
elif (max(int(a[0]), int(a[1])) - min(int(a[0]), int(a[1]))) < (max(int(a[0]), int(a[2])) - min(int(a[0]), int(a[2]))):
    print("A")

Submission status: Accepted

Solution code:
x, a, b = [int(i) for  i in input().split()]
if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x,a,b=map(int,raw_input().split())
a=abs(x-a)
b=abs(x-b)
if a<b :
    print 'A'
else :
    print 'B'

Submission status: Accepted

Solution code:
#!usr/bim/python
#! -*- coding: utf-8 -*-

nab = raw_input()
nab = nab.split()
n,a,b = map(int,nab)

if abs(n-a) < abs(n-b):
    print 'A'
else:
    print 'B'

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(x-a) <= abs(x-b):
	print('A')
else:
	print('B')

Submission status: Accepted

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

if abs(a-x)<abs(b-x):
    print("A")
else:
    print("B")

Submission status: Accepted

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

x,a,b = map(float,input().split())

if(abs(x-a)<abs(x-b)):
    print("A")
else:
    print("B")

Submission status: Accepted

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

if abs(a-x)  > abs(b-x):
    print('B')
else:
    print('A')

Submission status: Accepted

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

if abs(n-a) < abs(n-b):
    print 'A'
else:
    print 'B'

Submission status: Accepted

Solution code:
#! -*- coding:utf-8 -*-
x,a,b = map(int,input().split())
import math

if(math.copysign(x-a,0) < math.copysign(x-b,0)):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(a-x) < abs(x-b):
	print("A")
else:
	print("B")

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
ansa = (abs(x-a)< abs(x-b))
print("A" if ansa  else "B")

Submission status: Accepted

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

if (x-a)**2 >(x-b)**2:
    print("B")
else:
    print("A")

Submission status: Accepted

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

if abs(x-a) <= abs(x-b):
    print("A")
else:
    print("B")

Submission status: Accepted

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

A = abs(x-a)
B = abs(x-b)
if A < B:
    print("A")
else:
    print("B")

Submission status: Accepted

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

tmp = input()
x, a, b = [int(a) for a in tmp.split()]

d1 = abs(x - a)
d2 = abs(x - b)

print("A" if d1 < d2 else "B")

Submission status: Accepted

Solution code:
x,a,b = [int(i) for i in input().split()]
if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
ans = 'A' if abs(a-x) < abs(b-x) else 'B'
print(ans)

Submission status: Accepted

Solution code:
x,a,b=map(int,raw_input().split())
if abs(x-a)>abs(x-b): print 'B'
else: print 'A'

Submission status: Accepted

Solution code:
x, a, b = map(int,input().split())
if abs(x - a) < abs(x - b):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if abs(a-x) < abs(b-x):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
# Meal Delivery
x,a,b, = list(map(int, input().split()))

if ( abs(a-x) < abs(b-x) ):
    print("A")
else:
    print("B")

Submission status: Accepted

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

if abs(a-x) > abs(b-x):
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
# coding=utf-8
x, a, b = map(int, raw_input().split())
print 'A' if abs(x - a) < abs(x - b) else 'B'

Submission status: Accepted

Solution code:

def main():
    x, a, b = (int(z) for z in input().split())

    if abs(a-x) < abs(b-x):
        print("A")
    else:
        print("B")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
inp = lambda t: t(sys.stdin.readline().strip())
inpm = lambda t: map(t, sys.stdin.readline().split())
inpl = lambda t: list(map(t, sys.stdin.readline().split()))
print = lambda x, end='\n': sys.stdout.write(str(x) + end)

x, a, b = inpm(int)
if abs(a - x) < abs(b - x):
	print('A')
else:
	print('B')

Submission status: Accepted

Solution code:

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

if abs(x-a) > abs(x-b):
    print('B')
else:
    print('A')

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
    pirnt('A')
else:
    print('B')

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
print(min(abs(x-a),abs(x-b))

Submission status: Runtime Error

Solution code:
x, a, b = map(int, input.split())
print("A" if max(x, a) - min(x, a) < max(x, b) - min(x, b) else "B")

Submission status: Runtime Error

Solution code:
x, a, b = map(int, input().split())
print((abs(x-a) > abs(x-b)) ? "A" : "B")

Submission status: Runtime Error

Solution code:
a,b,c=(int(x) for x in input().split())
if a < b < c:
    print( 'A' )
elif a < c < b:
    print( 'A' )
elif b < a < c:
    print( 'B' )
elif b < c < a:
    print( 'B' )
elif c < a < b:
    print( 'C' )
elif c < b < a

Submission status: Runtime Error

Solution code:
x, a, b = map(int,input().split())
print('A') if abs(x-a) < abs(s-b) else print('B')

Submission status: Runtime Error

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

print(min(abs(X-A), abs(B-X))

Submission status: Runtime Error

Solution code:
x,a,c=map(int,input().split())
if abs(x-a)<=abs(x-b):
    print('A')
else:
    print('B')

Submission status: Runtime Error

Solution code:
import math
x,a,c=map(int,input().split())
if math.abs(x-a)<math.abs(x-b):
    print('A')
else:
    print('B')

Submission status: Runtime Error

Solution code:
import math
x,a,c=map(int,input().split())
if math.fabs(x-a)<math.fabs(x-b):
    print('A')
else:
    print('B')

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
if abs(a-x)>abc(b-x):
  print('A')
else:
  print('B')

Submission status: Runtime Error

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

int(input())
list(map(int,input().split()))
input().rstrip()

Submission status: Runtime Error

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from 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
from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10

N = INT()
S1 = input()
S2 = input()

if 1 < N and S1[0] == S1[1]:
	ans = 6
	tmp = 2
	flg = 1
else:
	ans = 3
	tmp = 1
	flg = 0


while tmp < N:
	if tmp < N-1 and S1[tmp] == S1[tmp+1]:
		if flg:
			ans *= 3
		else:
			ans *= 2
		flg = 1
		tmp += 2

	else:
		if flg:
			ans *= 1
		else:
			ans *= 2
		flg = 0
		tmp += 1
	ans %= mod


print(ans)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split(' ')))
x=0
y=0
a.sort()
a.reverse()
for i in range(len(a)-1):
    if a[i]==a[i+1]:
        x=a[i]
        p=i+1
        break
if x!=0:
    for i in range((p+1),len(a)-1):
        if a[i]==a[i+1]:
            y=a[i]
            break
print(x*y)

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
if abs(a-x)>abs(b-x):
  print(B)
else:
  print(A)

Submission status: Runtime Error

Solution code:
getList = lambda: list(map(int, input().split()))
a,b,x = getList()
if abs(a - x) < abs(b = x):
  print("A")
else:
  print("B")

Submission status: Runtime Error

Solution code:
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using static System.Math;

namespace ConsoleApp15
{
    class Class404
    {
        static void Main()
        {
            var r = Console.ReadLine().Split().Select(int.Parse).ToArray();
            int a = Abs(r[0] - r[1]);
            int b = Abs(r[0] - r[2]);
            if (a > b)
            {
                Console.WriteLine("B");
            }
            else
            {
                Console.WriteLine("A");
            }
        }
    }
}

Submission status: Runtime Error

Solution code:
n=int(input())
A=list(map(int,input().split()))
 
rec=set()
for i in range(n):
  if A.count(A[i])>=2:
    rec.add(A[i])

if len(rec)<2:
  print(0)
else:
  rec=sorted(list(rec), reverse=True)
  print(rec[0]*rec[1])

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
print(min(abs(x-a),abs(x-b))

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
y=abs(x-a)
z=abs(b-x)
    if y<z:
        print('A')
    else:
        print('B')

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
    if abs(x-a)<abs(b-x):
        print('A')
    else:
        print('B')

Submission status: Runtime Error

Solution code:
def dis():
  x = int(input())
  a = int(input())
  b = int(input())
  if abs(x-a)>abs(x-b):
    print("B")
  else:
    print("A")
    
dis()

Submission status: Runtime Error

Solution code:
x,a,b = map(int.input().split())
if abs(x-a) > abs(x-b):
    print('B')
else:
    print('A')

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
if abs(x - a) > abs(x - b):
    print('B')
else:
    print('A')

Submission status: Runtime Error

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

if abs(x-a) > abs(x-b):
    print(B)
else:
    print(A)

Submission status: Runtime Error

Solution code:
n = int(input())
A = sorted(list(map(int, input().split())), reverse = True)
l = 0
ln = []
for a in A:
    if l == a:
        ln.append(a)
        l = 0
    else:
        l = a
    if len(ln) == 2:
        break
if len(ln) == 2:
    print(ln[0]*ln[1])
else:
    print(0)

Submission status: Runtime Error

Solution code:
x,a,b = map(int,input())
if abs(a-x) > abs(b-x):
    print("B")
else:
    print("A")

Submission status: Runtime Error

Solution code:
x,a,b = map(int,input())
if abs(a-x) > abs(b-x):
    print("A")
else:
    print("B")

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
ad=abs(x-a)
bd=abs(x-b)

if ad > bd:
    print("A")
elif ad < bd
    print("B")

Submission status: Runtime Error

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

if min(abs(X - A) < abs(X - B)):
    print ('A')
else:
    print ('B')

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
if abs(a-b)<abs(a-c):
  prinnt('A')
else:
  print('B')

Submission status: Runtime Error

Solution code:
x,a,b = map(int, input().split())
A = max(x,a) - min(x,a)
B = max(x,b - min(x,b)
if A > B:
    print("B")
else:
    print("A")

Submission status: Runtime Error

Solution code:
x,a,b = map(int, input().split)
if abs(a-x) < abs(b-x):
  print('A')
else:
  print('B')

Submission status: Runtime Error

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

if |x - b| > |x - a|:
  print("A")
  
else:
  print("B")

Submission status: Runtime Error

Solution code:
x, a, b = map(int, input())
if abs(x-a) > abs(x-b):
  print('B')
else:
  print('A')

Submission status: Runtime Error

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

A = abs(x-a)
B = abs(x-b)

if A < B:
    print('A')
else:
    print('B')

Submission status: Runtime Error

Solution code:
x,a,b = map(int,input(),split())
if abs(x-a) >= abs(x-b):
  print('A')
else:
  print('B')

Submission status: Runtime Error

Solution code:
t = [int(v) for v in split(input())]

n = t[0] - t[1]
n2 = t[0] - t[2]
if abs(n) > abs(n2):
  print(n2)
else:
  print(n)

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
if |a-x|<|b-x|:print('A')
else:print('B')

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
print("A" if (abs(a-b)<abs(a-c)) else "B")

Submission status: Runtime Error

Solution code:
L=list(map(int,input().split()))
A=L[0]-L[1]
B=L[0]-L[2]
if min(A,B)=A:
	print("A")
else:
	print("B")

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
a_x=abs(a,x)
b_x=abs(b,x)
if a_x<b_x:
    print("A")
else:
    print("B")

Submission status: Runtime Error

Solution code:
x,a,b=[int(s) for s in input().split()]
if abs(a-x)<abs(b-x):
  print('A'):
else:
  print('B')

Submission status: Runtime Error

Solution code:
s = str(input())
alphabet = ["a","b","c","d","e","f"
,"g","h","i","j","k","l","m","n",
"o","p","q","r","s","t","u","v","w","x","y","z"]

for i in s:
    if i in alphabet:
        alphabet.remove(i)
if len(alphabet)!=:
    print(alphabet[0])
else:
    print("Nome")

Submission status: Runtime Error

Solution code:
S = list(input())

# 重要：アルファベットの配列を生成
alphabets = [chr(ord('a') + i) for i in range(26)]

# 除外文字を配列に入れる
excludeS = []
for i in range(len(alphabets)):
    if alphabets[i] not in S:
        excludeS.append(alphabets[i])
        flag = False
        if alphabets[i] == 'Z'
            flag = True
    else:
        flag = True

if flag:
    print('None')
else:
    # 辞書順に並び変えて一番小さい文字を求める
    sortedExcludeS = sorted(excludeS)
    minExcludeS = min(sortedExcludeS)
    print(minExcludeS)

Submission status: Runtime Error

Solution code:
n = int(input())
list1 = [int(x) for x in input().split()]
#print(list1)

set1 = set(list1)
#print(set1)

listans = []

for i in set1:
  if list1.count(i) > 1:
    listans.append(i)

#print(listans)

if len(listans) < 2:
  print(0)
else:
  print(sorted(listans)[-1]*sorted(listans)[-2])

Submission status: Runtime Error

Solution code:
n = int(input())
list1 = [int(x) for x in input().split()]
set1 = set(list1)

listans = []

for i in set1:
  if list1.count(i) > 2:
    listans.append(i)

if len(listans) < 2:
  print(0)
else:
  print(sorted(listans)[-1]*sorted(listans)[-2])

Submission status: Runtime Error

Solution code:
n = int(input())
list1 = [int(x) for x in input().split()]
#print(list1)

set1 = set(list1)
#print(set1)

listans = []

for i in set1:
  if list1.count(i) > 2:
    listans.append(i)

#print(listans)

if len(listans) < 2:
  print(0)
else:
  print(sorted(listans)[-1]*sorted(listans)[-2])

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b):
  print(B)
else:
  print(A)

Submission status: Runtime Error

Solution code:
x,a,b=mapt(int,input().split())
if abs(x-a)>abs(x-b):
  print(B)
else:
  print(A)

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
if abs(x-a)>=abs(x-b)
  print('B')
else:
  print('A')

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
if |x-a|>=|x-b|:
  print('B')
else:
  print('A')

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
print(print 'A' if max(abs(b-a),abs(c-a))==abs(b-a) else 'B')

Submission status: Runtime Error

Solution code:
x,a,b = map(int,input().split())
s = abs(a - x)
t = abs(b - x)

print(min[s, t])

Submission status: Runtime Error

Solution code:
n = int(input())
L = [int(i) for i in input().split()]
cnt = 0
ans = 1
for i in sorted(set(L),reverse=True):
  if L.count(i)>=4 and cnt==0:
    ans = i*i
    break
  elif 2<=L.count(i)<4:
    ans *= i
    cnt += 1
    if cnt == 2:
      break
  elif L.count(i)>=4 and cnt==1:
    ans *=i
    break
print(0 if ans==1 else ans)

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
if abs(a-t) > abs(b-t):
  print('B')
else:
  print('A')

Submission status: Runtime Error

Solution code:
x, a, b = map(int, input().split())
xa = abs(x-a)
xb = abs(x-b)
if xa < xb:
  print(A)
elif xa > xb:
  print(B)

Submission status: Runtime Error

Solution code:
x, a, b = map(int, input().split())
xa = abs(x-a)
xb = abs(x-b)
if xa < xb:
  print(A)
else:
  print(B)

Submission status: Runtime Error

Solution code:
x, a, b = map(int, input().split())
xa = abs(x-a)
xb = abs(x-b)
if xa > xb:
  print(A)
else:
  print(B)

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
print(min(abs(x-a)),abs(x-b))

Submission status: Runtime Error

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

if x > a:
	x_a = x - a
else:
x_a = a - x

if x > b:
	x_b = x - b
else:
	x_b = b - x
	

if x_a > x_b:
	print("B")
else:
	print("A")

Submission status: Runtime Error

Solution code:
x, a, b = map(int, input().split())
ax = abs(a-x)
bx = abs(b-x)
if ax > bx:
  print(B)
else:
  print(A)

Submission status: Runtime Error

Solution code:
#ABC071A
import math
x, a, b =list(map(int, input().split()))

ax = math.abs(a-x)
bx = math.abs(b-x)

if (ax < bx): print("A")
else: print('B')

Submission status: Runtime Error

Solution code:
x, a, b = map(int, (inp.readline().rstrip().split()))
if a < x:
    a_abs = x-a
else:
    a_abs = a-x

if b < x:
    b_abs = x-b
else:
    b_abs = b-x
if a_abs > b_abs:
    print("B")
else:
    print("A")

Submission status: Runtime Error

Solution code:
if a < x:
    a_abs = x-a
else:
    a_abs = a-x

if b < x:
    b_abs = x-b
else:
    b_abs = b-x
if a_abs > b_abs:
    print("B")
else:
    print("A")

Submission status: Runtime Error

Solution code:
x,a,b = map(int, input().split())
if (abs(x-a) > abc(x-b)):
    print("A")
else:
    print("B")

Submission status: Runtime Error

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

if |x - a| >= |x-b|:
  print('A')

else:
  print('B')

Submission status: Runtime Error

Solution code:
x,a,b=map(int,inpur().split())
if min(abs(x-a),abs(x-b))==abs(x-a):
  print("A")
else:
  print("B")

Submission status: Runtime Error

Solution code:
x,a,b=map(int,input().split())
print('A' if min(abs(a-x),abs(b-x)))==abs(a-x) else 'B')

Submission status: Runtime Error

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

if abs(nlist[0] - nlist[1]) < abs(nlist[0] - nlist[1]) :
	print("A")
else: 
	print("B")

Submission status: Runtime Error

Solution code:
x, a, b = map(int, input().split())
if abs(a-x) < abs(b-x):
  print('A')
elif:
  print('B')

Submission status: Runtime Error

Solution code:
a,b,c=input();print('YNeos'[a!=c::2])

Submission status: Runtime Error

Solution code:
x, a, b = list(map(int, input().split())
print("a" if abs(x-a) < abs(x-b) else "b")

Submission status: Runtime Error

Solution code:
x,a,b = map(int,input().split())
print(min(abs(x-a, x-b))

Submission status: Runtime Error

Solution code:
x,a,b = map(int,input().split())
print(min(abs(x-a, x-b)))

Submission status: Runtime Error

Solution code:
N=int(input())
A=[int(x) for x in input().split()]
AA=sorted(set(A),reverse=True)
li=[]
for aa in AA:
  if A.count(aa)>=4:
    print(aa**2)
    break
  if A.count(aa)>=2:
    li.append(aa)
  if len(li)==2:
    break
if len(li)==0:
  print(0)
if len(li)==2:
  print(li[0]*li[1])