peterverebics/CodeNet_Python_428 huggingface dataset:
# Judge status: Accepted
x,y=map(int,input().split())
a=max(x,y)
b=min(x,y)
s=a-b
A=a-s-s
if A>=0 and A%3==0:
    t=A//3
    p=t+s
    q=t
    ans=1
    for i in range(q):
        ans=ans*(p+q-i)*pow((i+1),10**9+5,10**9+7)
        ans=ans%(10**9+7)
    print(ans)
else:
    print(0)
# Judge status: Accepted
import math

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

num = y//x
# ans = int(math.log2(num) + 1)
ans = len(bin(num))-bin(num).find('1')
print(ans)
# Judge status: Wrong Answer
n = int(input())
a = list(map(int, input().split()))
max = a[0]
sum = 0
count = 0
result = 0

for i in range(0,n):
  if max > a[i]:
    count+=1
    sum+=a[i]
    if i == n-1:
      result += max*count-sum
  else:
    result += max*count-sum
    
print(result)
# Judge status: Accepted
n = list(input())
if (n[0] == n[1] and n[1] == n[2]) or \
    (n[1] == n[2] and n[2] == n[3]):
    print('Yes')
else:
    print('No')
# Judge status: Accepted
sum = input()

if len(sum) < 3:
    print('0')
else:
    last_2_digit = sum[-2:]
    upper_digit = sum[:-2]

    if last_2_digit == '00':
        print('1')
    else:
        required_num = (int(last_2_digit) - 1) // 5 + 1
        # print(upper_digit, last_2_digit, required_num)
        if int(upper_digit) >= required_num:
            print('1')
        else:
            print('0')
# Judge status: Accepted
n = int(input())
A = list(map(int, input().split()))
cnt = sum(1 for a in A if a < 0)
ls = list(map(abs, A))
ans = sum(ls)
if cnt % 2 == 0:
    print(ans)
else:
    print(ans-2*min(ls))
# Judge status: Accepted
a, b, c = map(int, input().split())
k       = int(input())

def predicate_green():
    return b > a

def predicate_blue():
    return c > b

while k != 0:
    if not predicate_green():
        b *= 2
        k -= 1

    elif not predicate_blue():
        c *= 2
        k -= 1

    else:
        break

if c > b > a:
    print('Yes')

else:
    print('No')
# Judge status: Accepted
n = int(input())
a = []
for _ in range(n):
    a.append(int(input()))
total = sum(a)
if total % 10 != 0:
    print(total)
else:
    a.sort()
    index = 0
    while index < n and a[index] % 10 == 0:
        index += 1
    if index == n:
        print(0)
    else:
        print(total - a[index])
# Judge status: Accepted
K,S = map(int, input().split())
print(sum(max(0, min(2*K-S+z+1, S-z+1)) for z in range(K+1)))
# Judge status: Wrong Answer
N=int(input())

P=[tuple(map(int,input().split())) for _ in [0]*N]
goodP=P[0]
res=-1

while 1:
    r=-1
    for x,y in P:
        nr=abs(x-goodP[0])+abs(y-goodP[1])
        if nr>r:
            r=nr
            ngoodP=(x,y)
    goodP=ngoodP
    if r==res:
        break
    else:
        res=r
print(res)
# Judge status: Accepted
import math
n, d = list(map(int, input().split()))
x = []
y = []
for _ in range(n):
    xi, yi = list(map(int, input().split()))
    x.append(xi)
    y.append(yi)
def distance(p, q):
    return math.sqrt(p**2 + q**2)
answer = 0
for i in range(n):
    if distance(x[i], y[i]) <= d:
        answer += 1
print(answer)
# Judge status: Wrong Answer
n,m = map(int,input().split())
l = [list(map(int,input().split())) for i in range(n)]
a,b = [list(i) for i in zip(*l)]
l = [list(map(int,input().split())) for i in range(m)]
c,d = [list(i) for i in zip(*l)]

for i in range(n):
    p = 10 ** 8
    t = 50
    for j in range(m):
        e = abs(a[i] - c[j]) + abs(b[i] - d[j])
        if p > e:
            p = e
            t = j + 1
    print(t)
# Judge status: Wrong Answer
#!/usr/bin/env python3
import numpy as np
import bisect
X = int(input())
A = np.cumsum(range(1, 10 ** 5))
if np.any(A == X):
    print(np.where(A == X)[0][0] + 1)
else:
    idx = bisect.bisect_left(A, X)
    print(X - A[idx - 1] + idx)
# Judge status: Accepted
n = list(input())
m = list(input())+[""]
for x,y in zip(n,m):print(x+y,end="")
# Judge status: Accepted
str = input()

def checkstr(str):
    if len(str) % 2 != 0: return False
    half = int(len(str) / 2)
    if str[0:half] == str[half:len(str)]: return True
    else: return False

for x in range(len(str) -1):
    answer = len(str) - (x + 1)
    check = checkstr(str[0:answer])
    if check == True: break
print(answer)
# Judge status: Accepted
n, m, k = map(int, input().split())
for i in range(n + 1):
    for j in range(m + 1):
        if i * (m - j) + j * (n - i) == k:
            print("Yes")
            exit()
print("No")
# Judge status: Accepted
w, a, b = list(map(int, input().split()))
ans = abs(a - b) - w
print(ans) if ans > 0 else print(0)
# Judge status: Wrong Answer
# -*- coding: utf-8 -*-
N,L = list(map(int, input().split()))
l=[]
for i in range(N):
    l.append(input())
l.sort()
print(l)
# Judge status: Accepted
# -*- coding: utf-8 -*-
 
N = int(input())
ans = 0

for i in range(1,N):
  ans += (N-1)//i

print(ans)
# Judge status: Accepted
a,b,c,d = map(int,input())

if (a == b == c) or (b == c == d):
    print('Yes')
else:
    print('No')
# Judge status: Wrong Answer
n,a,b = map(int,input().split())
mod = 10**9+7
ans = pow(2,n,mod)-1
fact = [1]*(2*10**5+1)
for i in range(2,2*10**5+1):
  tmp = fact[i-1]*i
  tmp %= mod
  fact[i]=tmp
  
def comb(n,k):
  k = min(k,n-k)
  fa = 1
  for i in range(n,n-k,-1):
    fa*=i
    fa%=mod
  return fa*pow(fact[k],mod-2,mod)
mi = comb(n,a)+comb(n,b)
mi%=mod
ans-=mi
print(ans)
# Judge status: Accepted
A,B=map(int,input().split())
if A<=8 and B<=8:
    print('Yay!')
else:
    print(':(')
# Judge status: Accepted
n, m = map(int, input().split())

a = [0 for _ in range(m)]

for i in range(n):
    p = list(map(int, input().split()))
    k = p[0]
    for i in range(1, k+1):
        a[p[i]-1] += 1

ans = 0
for i in range(m):
    if a[i] == n:
        ans += 1

print(ans)
# Judge status: Wrong Answer
n,q = map(int,input().split())
s = list(input())
base = [0]*n
count = 0

for i in range(n-1):
  if (s[i] == "A") and (s[i+1] == "C"):
    count = count + 1
    base[i] = count
  else:
    base[i] = count

base[n-1] = base[n-2]

for i in range(q):
  l,r = map(int,input().split())
  ans = base[r-1] - base[l-1]
  
  if s[r-1] == "A":
    ans = ans - 1
  
  if s[l-1] == "A":
    ans = ans + 1
    
  print(ans)
# Judge status: Accepted
import itertools

n = int(input())
s = list(input())
s1 = [1 if s[i] == 'I' else -1 for i in range(n)]
cumsum = list(itertools.accumulate(s1))
ans = max(cumsum)
print(max(ans, 0))
# Judge status: Accepted
k=int(input())
if k%2==0 or k%5==0:
    print(-1)
    exit()
count=0
a=0
while True:
    a=(a*10+7)%k
    count+=1
    if a==0:
        print(count)
        exit()
# Judge status: Accepted
import sys
input = sys.stdin.readline

def main():
    N = int(input())
    ans = 0
    for i in range(1, N+1):
        if i%3 != 0 and i%5 != 0:
            ans += i
    print(ans)


if __name__ == "__main__":
    main()
# Judge status: Wrong Answer
from math import factorial

n,k = map(int,input().split())
s = 0
mod = 10*9+7

for i in range (k,n+1):
    c1 = factorial(n+1) % mod
    c2 = 1 / factorial(i)
    c3 = 1 / factorial(n+1 - i)
    c = c1 * c2 * c3
    d = n+1 - (i + 1)
    s = s + (c-d) % mod

s = int((s+1) % mod)

print (s)
# Judge status: Accepted
a,b,c = map(int,input().split())
print("YES" if b-a == c-b else "NO")
# Judge status: Accepted
A = input()
B = input()

if A == B[2]+B[1]+B[0]:
  print("YES")
else:
  print("NO")
# Judge status: Accepted
import math

i = int(input())

r = math.sqrt(i)

ir = int(r)

print(ir*ir)
# Judge status: Accepted
s = input()

check = [0]*4

for i in range(len(s)):
    if s[i] == "N" and check[0] == 0:
        check[0] = 1
    if s[i] == "S" and check[1] == 0:
        check[1] = 1
    if s[i] == "W" and check[2] == 0:
        check[2] = 1
    if s[i] == "E" and check[3] == 0:
        check[3] = 1
if check[0] == check[1] and check[2] == check[3]:
    print("Yes")
else:
    print("No")
# Judge status: Accepted
N, Q = map(int, input().split())
S = input()

C = [0]*N
for i in range(1, N):
    C[i] += C[i-1]
    if(S[i-1:i+1] == 'AC'):
        C[i] += 1

for i in range(Q):
    l, r = map(int, input().split())
    print(C[r-1]-C[l-1])
# Judge status: Accepted
import math
N, D = list(map(int, input().split()))
def dis(x, y):
    return math.sqrt(x**2+y**2)

cnt = 0
for _ in range(N):
    x, y = list(map(int, input().split()))
    if dis(x, y)<=D:
        cnt+=1
print(cnt)
# Judge status: Accepted
n=int(input())
trans=[0]*5
for i in range(5):
    trans[i]=int(input())
print(-(-n//min(trans))+4)
# Judge status: Accepted
n,m = map(int,input().split())
b = [int(input()) for _ in range(m)]
a = set(b)

dp = [0] * (n+1)
dp[0] = 1
dp[1] = 1

for i in range(2,n+1):
  if i-1 in a :
    dp[i-1] = 0
  if i-2 in a :
    dp[i-2] = 0
  dp[i] = dp[i-1] + dp[i-2]

print(dp[n] % 1000000007)
# Judge status: Accepted
k,a,b =  map(int,input().split())

c = b-a

if c >1:
    if k < a-1:
        print(1+k)
        exit(0)
    else:
        d=(k-a+1)
        if d %2==0:
            print(c*(d//2)+a)
        else:
            print(c*(d//2)+a+1)
        exit(0)
else:
    print(1+k)
# Judge status: Accepted
def main():
    X = int(input())
    deposit = 100

    i = 0
    while True:
        deposit = int(deposit * 1.01)
        i += 1

        if deposit >= X:
            print(i)
            exit()

if __name__ == '__main__':
    main()
# Judge status: Accepted
a,b,c = map(int,input().split())
s = set()
s.add(a)
s.add(b)
s.add(c)
if len(s) == 2:
    print('Yes')
else:
    print('No')
# Judge status: Accepted
N = int(input())
a = list(map(int,input().split()))
 
ans = 0
 
for i in range(N):
  if i%2==0 and a[i]%2==1:
    ans += 1

print(ans)
# Judge status: Accepted
"""
Nは10**5以下。O(N)なら通る
"""

N = int(input())
A = []
B = []
for i in range(N):
    s = list(map(int, input().split()))
    A.append(s[0])
    B.append(s[1])

count = 0
for i in reversed(range(N)):
    if (count + A[i]) % B[i] == 0:
        continue
    else:
        s = B[i] - (count + A[i]) % B[i]
        count += s

print(count)
# Judge status: Wrong Answer
from math import *
import sys

sys.stdin.readline()
L = list(set(list(map(int, sys.stdin.readline().split()))))
L = sorted(L)
l = len(L)


count = 0
for i in range(l-2):
    for j in range(i+1, l-1):
        for k in range(j+1, l):
            if L[i] < L[j] + L[k]:
                if L[j] < L[i] + L[k]:
                    if L[k] < L[i] + L[j]:
                        count += 1

print(count)
# Judge status: Wrong Answer
import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
if N == K:
    print(1)
else:
    print(math.ceil(N/(K-1)))
# Judge status: Accepted

S, W = map(int, input().split())

if S <= W:
    print("unsafe")
else:
    print("safe")
# Judge status: Accepted
a,b,c=map(int,input().split())
if (a==b and a!=c) or (a==c and b!=c) or (b==c and a!=b):
  print('Yes')
else:
  print('No')
# Judge status: Accepted
n,m=map(int,input().split())
h=list(map(int,input().split()))
lower=[0]*n
for i in range(m):
    a,b=map(int,input().split())
    if h[a-1] <= h[b-1]:
        lower[a-1] += 1
    if h[a-1] >= h[b-1]:
        lower[b-1] += 1
print(lower.count(0))
# Judge status: Accepted
S = input()
T = input()
ans = float("INF")
for i in range(len(S)-len(T)+1):
    cnt = 0
    for j in range(len(T)):
        if S[i+j] != T[j]:
            cnt += 1
    ans = min(ans,cnt)
print(ans)
# Judge status: Accepted
x=int(input())

time=0
pos =0

while pos<x:
    time+=1
    pos=time*(time+1)//2
print(time)
# Judge status: Wrong Answer
sd = input()
t = input()

sd_len = len(sd)
t_len = len(t)

sd_list = list(sd)
t_list = list(t)

#print(t_list)

for i in range(sd_len):
  if sd[i] == "?":
    continue
  for j in range(t_len):
    sd_len_re = sd_len - i
    if sd[i] == t[j] and sd_len_re >= t_len:
      sd_list[i:] = t[:]
      sd = "".join(sd_list)
      print(sd.replace("?","a"))
      exit()
    elif t_len > sd_len_re:
      break
print("UNRESTORABLE")
# Judge status: Accepted
a,b=map(int,input().split())

print(int((b-2)/(a-1) +1))
# Judge status: Wrong Answer
import re
S = input()
liS = re.split('(..)', S)[1::2]

for x in liS:
    if x == 'hi':
        pass
    else:
        print('No')
        exit()

print('Yes')
# Judge status: Accepted
S=int(input())
MOD=10**9
if S%MOD==0:
    s=0
else:
    s=MOD-S%MOD

X1,Y2=s,1
Y1=10**9
X2=(S+X1)//Y1

print(0,0,X1,Y1,X2,Y2)
# Judge status: Accepted
N,K=map(int,input().split())
A=[int(i) for i in input().split()]
ex=0
for test in range(K):
    ex+=1
    D=[0 for i in range(N+1)]
    for i in range(N):
        D[max(0,i-A[i])]+=1
        D[min(N,i+A[i]+1)]-=1
    A[0]=D[0]
    for i in range(1,N):
        A[i]=A[i-1]+D[i]
    if set(A)=={N}:
        break
print(*A)
# Judge status: Wrong Answer
a,b = input().split()
a = int(a)
b = int(b)
print ((a+b) //2 +1)
# Judge status: Wrong Answer
n = int(input())
a = list(map(int, input().split()))
ans = []
for i in range(n):
    if a[i] % 2 == 0:
        if a[i] % 3 == 0 or a[i] % 5 == 0:
            ans.append(1)
        else:
            ans.append(-1)
if len(set(ans)) == 1 or len(set(ans)) == 0:
    print('APPROVED')
else:
    print('DENIED')
# Judge status: Accepted
import numpy as np
n=int(input())
a=[0]*n
b=[0]*n
for i in range(n):
  a[i],b[i]=map(int,input().split())

flag=True
sum=0
sorted_index=np.argsort(b)
for i in sorted_index:
  sum+=a[i]
  if sum>b[i]:
    flag=False
    break
    
if flag:
  print('Yes')
else:
  print('No')
# Judge status: Wrong Answer
s=input()
lis=[]
for i in range(len(s)):
    if s[i]=='0': lis.append('0')
    elif s[i]=='1': lis.append('1')
    elif s[i]=='B' and len(lis)==0: continue
    else: lis.remove(lis[-1])
print(''.join(lis))
# Judge status: Wrong Answer
N, K = map(int, input().split())
A = list(map(int, input().split()))
print(N//K + N - N//K*K)
# Judge status: Wrong Answer
S=input()

if(S[0]==S[1] and S[2]==S[3]):
    print("Yes")

elif(S[0]==S[2] and S[1]==S[3]):
    print("Yes")

elif(S[0]==S[3] and S[1]==S[2]):
    print("Yes")

else:
    print("No")
# Judge status: Accepted
a=list(map(int,input().split()))
count=0
for v in range(2):
    if a[0]>=a[1]:
        count+=a[0]
        a[0]-=1
    else:
        count+=a[1]
        a[1]-=1
print(count)
# Judge status: Accepted
a, b = map(int, input().split())

if a >= 10 or b >= 10:
    print('-1')
else:
    print(a * b)
# Judge status: Accepted
import numpy as np
ans=0
D=int(input())
C=np.array(list(map(int,input().split())))
last_day=np.array([0 for _ in range(26)])

for day in range(1,D+1):
    score=np.array(list(map(int,input().split())))
    tmp=C*(last_day-day)
    S=sum(tmp)
    for k in range(26):
        tmp[k]=score[k]+S-tmp[k]
    #今回行うコンテストで得られる
    idx=np.argmax(tmp)
    # ans=ans+score[idx]+np.sum(tmp)+abs(tmp[idx])
    last_day[idx]=day
    print(idx+1)
# Judge status: Accepted
a,b=map(int,input().split())
if a>8 or b>8:
    print(':(')
else:
    print('Yay!')
# Judge status: Wrong Answer
N=int(input())
if N<1000:
  print('ABC{0}'.format(N))
else:
  print('ABD{0}'.format((N+1)%1000))
# Judge status: Wrong Answer
a, b, c, k = map(int, input().split())
print((k % 2) * (a - b))
# Judge status: Accepted
a, b =	input().split()
a = int(a)
b = b.replace(".", "")
b = int(b)
print(a * b // 100)
# Judge status: Accepted
N = int(input())
a = []
for _ in range(N):
    x,l = map(int,input().split())
    a.append([x-l,x+l])
a.sort()
ans = 0 
right = -1*1000000000000
for i in a:
    if i[0] >= right:
        ans += 1
        right = i[1]
    else:
        if right > i[1]:
            right = i[1]
print(ans)
# Judge status: Accepted
a, b, c, x, y = map(int, input().split())
ans = a * x + b * y
for i in range(0, 2 * max(x, y) + 2, 2):
    pay = max(0, (x - i / 2)) * a + max(0, (y - i / 2)) * b + c * i
    ans = min(ans, pay)
print(int(ans))
# Judge status: Accepted
A, B = map(int, input().split())
ans = -1
for x in range(1010):
    if int(x*0.08) == A and int(x*0.1) == B:
        ans = x
        break

print(ans)
# Judge status: Wrong Answer
N = int(input())
S = input().split()
X = S[:N//2+1]
if N%2 == 0 and X+X == S:
  print('Yes')
else:
  print('No')
# Judge status: Accepted
N,Q = map(int,input().split())

s = input()

pre = [0]

for i,c in enumerate(s):
  last = pre[len(pre) -1 ]
  if i > 0 and c == 'C' and s[i-1] == 'A':
    pre.append(last+1)
  else:
    pre.append(last)
    
for _ in range(Q):
  l,r = map(int,input().split())
  ans = pre[r] - pre[l-1] + (0 if pre[l-1] == pre[l] else -1)
  print(ans)
# Judge status: Accepted
import sys
n,m = map(int,input().split())

if abs(n-m) >= 2:
    print(0)
    sys.exit()

if abs(n-m) == 1:
    x = max(n,m)
    for i in range(1,min(n,m)+1):
        x = x*i**2 % (10**9 + 7)

else:
    x = 2
    for i in range(1,n+1):
        x = x*i**2 % (10**9 + 7)
print(x)
# Judge status: Accepted
from math import ceil

n = int(input())
ab = reversed([list(map(int, input().split())) for _ in range(n)])

count = 0
for a, b in ab:
    a += count
    tb = ceil(a / b) * b
    count += tb - a

print(count)
# Judge status: Wrong Answer
N=int(input())

ac=0
wa=0
tle=0
re=0

S=[input() for i in range(N-1)]
for s in S:
    if s =='AC':
        ac=ac+1
    elif s == 'WA':
        wa = wa + 1
    elif s == 'TLE':
        tle = tle + 1
    else:
        re = re + 1

print("AC × ",ac)
print("WA × ",wa)
print("TLE × ",tle)
print("RE × ",re)
# Judge status: Wrong Answer
x = list(map(int, input().split()))
for i in range(0, 4): 
  if x[i]==0 : 
    i+=1
    print(i) 
    break
  else:
    i+=1
# Judge status: Accepted
s,t = input().split()
print(t,s,sep='')
# Judge status: Accepted
import sys
s=list(input())
t=set(s)

r='abcdefghijklmnopqrstuvwxyz'

for i in range(26):
  if r[i] not in t:
    print(r[i])
    sys.exit()
    
print('None')
# Judge status: Wrong Answer
a, b, n = list(map(int, input().split()))

print((a * n) // b - a * (n // b))
# Judge status: Wrong Answer
a,b,x = map(int,input().rstrip().split(" "))
if b - a + 1 >= x:
  if a % x != 0:
    a += x - (a % x)
    b -= (b % x)
  print((b - a) / x + 1)
else:
  if a + x - (a % x) > b:
    print(0)
  else:
    print(1)
# Judge status: Accepted
a, b = map(int, input().split())
if a <= 0 and b >= 0 or a == 0 or b == 0:
  print('Zero')
elif a < 0 and b < 0 and (b - a) % 2 == 0:
  print('Negative')
else:
  print('Positive')
# Judge status: Accepted
s=input()
ans=753
for i in range(3,len(s)+1):
    ans=min(abs(int(s[i-3:i])-753),ans)
print(ans)
# Judge status: Accepted
n,k = map(int,input().split())
h = list(map(int,input().split()))

c = []
c.append(0)

for i in range(1,n):
    c.append(min([ c[max(i-j,0)] + abs(h[i] - h[max(i-j,0)]) for j in range(1,k+1) ]))

print(c[n-1])
# Judge status: Accepted
n, h = list(map(int, input().split()))

wield = 0
bs = []

for i in range(n):
    a, b = list(map(int, input().split()))

    if a > wield:
        wield = a

    bs.append(b)

throw = []

for i in range(n):
    if bs[i] > wield:
        throw.append(bs[i])

total = sum(throw)

if total > h:
    throw = sorted(throw, reverse=True)

    total = 0
    ind = 0
    while total < h:
        total += throw[ind]
        ind += 1

    print(ind)
else:
    print((h-total+wield-1)//wield + len(throw))
# Judge status: Accepted
from collections import deque

k = int(input())

que = deque([1,2,3,4,5,6,7,8,9])

for n in range(0, k):
  x = que.popleft()
  if x % 10 != 0:
    que.append(x * 10 + x % 10 - 1)
  que.append(x * 10 + x % 10)
  if x % 10 != 9:
    que.append(x * 10 + x % 10 + 1)

print(x)
# Judge status: Wrong Answer
n = int(input())
arr = list(map(int, input().split()))

odd_num = 0
four_num = 0
two_num = 0
cnt = len(arr) - four_num
for e in arr:
    if e % 2 != 0:
        odd_num += 1
    if e == 2:
        two_num += 1
    if e % 4 == 0:
        four_num += 1
if two_num > 0: two_num = 1

print("Yes" if four_num >= odd_num + two_num - 1 else "No")
# Judge status: Wrong Answer
A, B, C = sorted(map(int, input().split()))
K = int(input())
#黒板に書かれている整数のうち 1 つを選び, これを 2 倍した値に書き換える. 
print(A + B + C*2*K)
# Judge status: Accepted
n=int(input())
num=str(n)[0]*3

if n<=int(num):
  print(num)
  
else:
  print(int(num)+111)
# Judge status: Accepted

from math import gcd
from functools import reduce

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

res = reduce(gcd, [abs(v - X) for v in A])
print(res)
# Judge status: Accepted
N = int(input())
K = int(input())
X = int(input())
Y = int(input())

if N <= K:
  print(N*X)
else:
  print(K*X + (N-K)*Y)
# Judge status: Accepted
s = input()
t = input()
 
s_c = []
t_c = []
for c in 'abcdefghijklmnopqrstuvwxyz':
    s_c.append(s.count(c))
    t_c.append(t.count(c))
s_c.sort()
t_c.sort()
if s_c == t_c:
    print('Yes')
else:
    print('No')
# Judge status: Wrong Answer
def calculate(N,X,T):
    x = N // X
    if x ==0:
        return T
    elif not N % X == 0:
        return (x + 1)*T;
    else:
        return x*T
N,X,T = 100,20,30
result = calculate(100,20,30)
print(result)
# Judge status: Accepted
A,B = map(int,input().split())
if A == B:
  print("Draw")
elif A == 1:
  print("Alice")
elif B == 1:
  print("Bob")
elif A > B :
  print("Alice")
else:
  print("Bob")
# Judge status: Accepted
n=int(input())
p=list(int(i) for i in input().split())
ps=sorted(p)
c=0
for i in range(n):
  if p[i] != ps[i]:
    c+=1
print("YES" if c<=2 else "NO")
# Judge status: Accepted
n,m,q = map(int,input().split())
li = [i for i in range(1,m+1)]
lin = []

for _ in range(q):
    a,b,c,d = map(int,input().split())
    lin.append((a,b,c,d))

from itertools import combinations_with_replacement
li = list(combinations_with_replacement(li, n))
ma = 0

for i in li:
    point = 0
    for j in lin:
        a,b,c,d = j
        a -= 1
        b -= 1
        if i[b]-i[a] == c:
            point += d
    ma = max(point,ma)

print(ma)
# Judge status: Accepted
import math
N = int(input())
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())


ans = 4 + math.ceil(N / min(A, B, C, D, E))
print(ans)
# Judge status: Wrong Answer
x, a, b = map(int, input().split())

if abs(a - x) > abs(b - x):
  print('A')
else:
  print('B')
# Judge status: Accepted
x,y = map(int, input().split())
if x==2 or y==2:
  print("No")
  exit()

if x==4 or x==6 or x==9 or x==11:
  if y==4 or y==6 or y==9 or y==11:
    print("Yes")
  else:
    print("No")
else:
    print("Yes")
# Judge status: Accepted
A = list(map(int, input().split()))
ans = 0
while A[0] % 2 == 0 and A[1] % 2 == 0 and A[2] % 2 == 0:
    if A[0] == A[1] and A[0] == A[2]:
        ans = -1
        break
    A[0], A[1], A[2] = ( A[1] + A[2] ) / 2, ( A[2] + A[0] ) / 2, ( A[0] + A[1] ) / 2
    ans += 1
print(ans)
# Judge status: Wrong Answer
N,H = map(int,input().split())
A = []
B = []
for _ in range(N):
    a,b = map(int,input().split())
    A.append(a)
    B.append(b)
A.sort()
B.sort()
from bisect import bisect_right
val = A[-1]
idx = bisect_right(B,val)
B= B[idx:]
cnt = 0
while B:
    H-=B.pop()
    cnt += 1
    if N<=0: print(cnt);exit()
cnt += H//val
cnt += 1 if H%val else 0
print(cnt)
# Judge status: Accepted
n=int(input())
s=input()
l=[]
k=len(s.replace(".",""))
ans=n-k
#自分含め左にいくつ黒があるか
cnt=0
#左の黒、右の白
for i in range(n):
  cnt+=int(s[i]=="#")
  ans=min(ans,2*cnt+n-i-1-k)
print(ans)
# Judge status: Accepted
s = input()
n = len(s)
ans = float("inf")
for i in range(n-2):
    ans = min(ans,abs(eval(s[i:i+3])-753))
print(ans)
# Judge status: Wrong Answer
N = int(input())
XL = [list(map(int,input().split())) for i in range(N)]
XL.sort(key=lambda x: (x[0]-x[1],x[0]+x[1]))
M = XL[0][0]+XL[0][1]-1
ans = N
for i in range(1,N):
    if M >= XL[i][0]-XL[i][1]+1:
        ans -= 1
    else:
        M = XL[i][0]+XL[i][1]-1
print(ans)
# Judge status: Accepted
n=int(input())
arr=list(map(int,input().split()))
diff=0
for i in range(n):
  if arr[i] != (i+1):
    diff+=1

print("YES" if diff==2 or diff==0 else "NO")
# Judge status: Accepted
S=input()
n=len(S)
ans=0

no=False
for i in range(n):
    for j in range(i,n):
        for k in range(i,j+1):
            if not S[k] in ("A","C","G","T"):
                no=True
                break
        if no:
            no=False
            break
        ans=max(ans,j-i+1)
print(ans)
# Judge status: Accepted
N,M = map(int,input().split())
A = list(map(int,input().split()))

if sum(A)>N:
  print(-1)
else:
  print(N-sum(A))
# Judge status: Accepted
n=int(input())

x=800*n
y=200*(n//15)
print(x-y)