peterverebics/CodeNet_Python_428 huggingface dataset:
# Judge status: Wrong Answer
a, b = map(int, input().split())
if a < b:
  print(a)
else:
  print(b)
# Judge status: Accepted
n, x = map(int, input().split())
l = [int(s) for s in input().split()]

pos = 0
count = 1
for i in range(n):
    pos += l[i]
    if pos > x:
        break
    count += 1
print(count)
# Judge status: Wrong Answer
n=int(input())
print(round(n/2)+1)
# Judge status: Wrong Answer
X = input()

X = int(X)

if X >= 30:
    print('YES')
else:
    print('NO')
# Judge status: Wrong Answer
N = int(input())
S = list()
num = 1


for i in range(N):
    S.append(input())

for i in range(N):
    for j in range(i+1,N):
        if i == j:
            break
        elif S[i] != S[j]:
            num += 1
            break

print(num)
# Judge status: Accepted
def main():
    import sys
    input = sys.stdin.readline

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

    if A >= K:
        print(A-K, B)
    else:
        print(0, max(0, B+A-K))


if __name__ == "__main__":
    main()
# Judge status: Accepted
a, b, c = list(map(int, input().split()))
if (c - a - b) > 0 and (c - a - b) ** 2 > 4 * a * b:
    print("Yes")
else:
    print("No")
# Judge status: Accepted
nums = list(map(int, input().split(' ')))
k = input()
k = int(k)
i = 0

for i in range(k):
  maxindex = max(enumerate(nums), key = lambda x:x[1])[0]
  nums[maxindex] *= 2
  i = i + 1

print(sum(nums))
# Judge status: Accepted
#C
#入力
N=int(input())
A=list(map(int,input().split()))

#処理
B=[0 for i in range(N)]

for i in range(N):
    B[A[i]-1]=i+1
    

for i in B:
    print(i,end=" ")
# Judge status: Wrong Answer
s = input()
if s[0] != s[1] != s[2] and s[1] != s[2]:
    print('Yes')
else:
    print('No')
# Judge status: Wrong Answer
import itertools

n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = sorted(p)

a = 0
b = 0

for i, j in enumerate(itertools.permutations(r, 3)):
    if list(j) == p:
        a = i
    if list(j) == q:
        b = i

print(abs(b-a))
# Judge status: Wrong Answer
h,w,x,y=map(int,input().split())
print(h*w/2, int((2*x==w) and (y*2==h)))
# Judge status: Accepted
n = int(input())
p = 1
for i in range(10):
  p = p*2
  if(p>n):
    print(2**i)
    break
# Judge status: Accepted
#参考にしたい解答
S = input() 
i= 0
ans = 0
moji1 = ""
moji2 = ""
while i < len(S):
    if i == 0:
        moji1 = S[i]
        ans += 1
    else:
        moji2 = moji2 + S[i]
        if moji1 != moji2:
            ans += 1
            moji1 = moji2
            moji2 = ""
        else:
            moji2 = moji2 + S[i]
    i += 1
 
print(ans)
# Judge status: Wrong Answer
n = int(input())
A1 = tuple(map(int, input().split()))
A2 = tuple(map(int, input().split()))

from itertools import accumulate
A1S = [0] + list(accumulate(A1))
A2S = [0] + list(accumulate(A2))

for i in range(1, n+1):
    if A1S[-1] - A1S[i] <= A2S[-1] - A2S[i]:
        break

print(A1S[i] + A2S[-1] - A2S[i-1])
# Judge status: Accepted
s=list(input())
r=[]
for x in s:
    if x=="0":r.append("0")
    if x=="1":r.append("1")
    if x=="B" and len(r)>0:
        r.pop()
print("".join(r))
# Judge status: Accepted
import sys
input = sys.stdin.readline

n, k = [int(x) for x in input().split()]

ans = 0

for i in range(1, n + 1):
    score = i
    cnt = 0
    while score < k:
        cnt += 1
        score *= 2
    ans += (1/n) * (1/2)**cnt

print(ans)
# Judge status: Accepted
import math
def prime(n):
    for i in range(2, int(math.sqrt(n))):
        if n % i == 0: return False
    return True

X = int(input())

for i in range(X, 10**8):
    if prime(i):
        print(i)
        exit(0)

print('No prime number in this range')
# Judge status: Accepted
x = int(input())

cnt = 0
for i in range(10**5):
    cnt += i
    if x <= cnt:
        print(i)
        break
# Judge status: Accepted
S = input()

if S[-1] == 's':
    print(S + 'es')
else:
    print(S + 's')
# Judge status: Wrong Answer
S, W = list(map(int, input().split()))

if S < W*2:
    print("unsafe")
else:
    print("safe")
# Judge status: Accepted
S = input()

if len(set(S)) == 1:
    print("No")
else:
    print("Yes")
# Judge status: Wrong Answer
import sys
input=sys.stdin.readline
import math

A,B = (int(x) for x in input().rstrip('\n').split())
c = math.gcd(A,B)
res = 1
d = math.floor(math.sqrt(c))
for i in range(2,d+2):
  if c%i==0:
    res += 1
    while c%i==0:
      c = c//i
print(res)
# Judge status: Accepted
n = int(input())
a = list(map(int, input().split()))

cnt = 0
num = 1

for i in range(n):
    if a[i] == num:
        num += 1
    else:
        cnt += 1
if 1 in a:
   print(cnt)
else:
    print(-1)
# Judge status: Wrong Answer
from scipy.special import comb

N = int(input())
mod = 10 ** 9 + 7

total = 0

A = N % 3
B = N // 3

while B >= 0:
    total += comb(A + 1, B - 1, exact=True)
    A += 3
    B -= 1

print(total % mod)
# Judge status: Accepted
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n, k = map(int, readline().split())
r, s, p = map(int, readline().split())
t = readline().decode().rstrip()
t = list(t)
for i in range(k, n):
    if t[i] == t[i - k]:
        t[i] = 0

ans = t.count('r') * p + t.count('p') * s + t.count('s') * r
print(ans)
# Judge status: Accepted
n, k, q = map(int, input().split())
ansnum = [0] * n
for i in range(q):
  a = int(input())
  ansnum[a - 1] += 1
for i in range(n):
  if q - ansnum[i] >= k:
    print('No')
  else:
    print('Yes')
# Judge status: Accepted
n=int(input())
lis=list(map(lambda x:format(int(x),'b'),input().split()))
l=0
for i in range(n):
    l=max(l,len(lis[i]))

d0=[0]*60
d1=[0]*60

for i in range(n):
    lis[i]=lis[i].zfill(l)
    for j in range(l):
        if lis[i][-j-1]=='0':
            d0[j]+=1
        else:
            d1[j]+=1

ans=0
for i in range(60):
    ans+=(d0[i]*d1[i]*2**i)%(10**9+7)
print(ans%(10**9+7))
# Judge status: Accepted
n=int(input())
t,a=map(int,input().split())
m=10000
h=list(map(int,input().split()))
for i in range(n):
  x=t-h[i]*0.006
  m=min(m,abs(x-a))

for i in range(n):
  if m==abs((t-h[i]*0.006)-a):
    print(1+i)
# Judge status: Accepted
N,K = map(int,input().split())
N = N % K
print (min(N,K-N))
# Judge status: Accepted
from functools import reduce
from fractions import gcd

n = int(input())
t = [int(input()) for _ in range(n)]

lcm = lambda x,y:x//gcd(x,y)*y

ans=reduce(lcm,t)

print(ans)
# Judge status: Accepted
N = int(input())
if N == 0:
  print(0)
  quit()

S = ''
while N != 0:
  if N % 2 == 0:
    S += '0'
    N //= -2
  else:
    S += '1'
    N -= 1
    N //= -2

print(S[::-1])
# Judge status: Accepted
N = int(input())
ab = [list(map(int, input().split())) for _ in range(N)]

ba = []
for i, j in ab:
    ba.append([j, i])

ab.sort()
ba.sort(reverse = True)

if N % 2 == 1:
    n = (N+1) // 2 - 1
    ans = ba[n][0] - ab[n][0] + 1
    
else:
    n = N // 2 - 1
    ans = (ba[n][0] + ba[n+1][0]) - (ab[n][0] + ab[n+1][0]) + 1

print(ans)
# Judge status: Wrong Answer
A,B,C = map(int,input().split())
if A%2==0 or B%2==0 or C%2==0:
    ans=0
else:
    ans=int(A*B*C/max(A,B,C))

print(ans)
# Judge status: Wrong Answer
s = input()
print(chr(ord('s') + 1))
# Judge status: Wrong Answer
n, k , s = map(int, input().split())
ans = []
for i in range(n):
    if k != 0:
        ans.append(s)
        k -= 1
    else:
        ans.append(s+1)
print(" ".join([str(x) for x in ans]))
# Judge status: Accepted
N=int(input())
A=list(map(int,input().split()))
AA=[0]
for a in A[1:]:
    AA.append(AA[-1]+a)
f=1 if A[0]==0 or N==0 and A[0]==1 else 0
r=1
b=1
for i,a in enumerate(A[1:]):
    x=min(b*2,AA[-1]-AA[i])
    if i<N-1 and x>a or i==N-1 and x==a:
        b=x-a
        r+=x
    else:
        f=0
print(r if f else -1)
# Judge status: Wrong Answer
N = int(input())

count = 0
for i in range(26):
    for j in range(15):
        if 4*i+7*j == N:
            print("Yes")
            print(i,j)
            count += 1
if count == 0:
    print("No")
# Judge status: Accepted
from collections import Counter

N = int(input())
counter = [Counter(input()) for _ in range(N)]

c = counter[0]
for i in range(1, N):
    for k, v in c.items():
        c[k] = min(counter[i][k], c[k])

c = sorted(c.items())
answer = ""
for k, v in c:
    answer += k * v

print(answer)
# Judge status: Wrong Answer
n,m = list(map(int,input().split()))
A = list(map(int,input().split()))
a = n-sum(A)
if a <= n:
    print(a)
else:
    print(-1)
# Judge status: Wrong Answer
N, M = map(int, input().split())

ans = dict()
for i in range(M):
    a, b = map(int, input().split())
    if a in ans:
        ans[a] += 1
    else:
        ans[a] = 1
    if b in ans:
        ans[b] += 1
    else:
        ans[b] = 1
        
for v in ans.values():
    print(v)
# Judge status: Wrong Answer
a,b = map(int, input().split())
print('Yay!') if(a>8 or b>8) else print(':(')
# Judge status: Accepted
n = int(input());
ac=wa=tle=re = 0;
for i in range(n) :
    s = input();
    if s == 'AC' :
        ac += 1;
    elif s == 'WA' :
        wa += 1;
    elif s == 'TLE' :
        tle += 1;
    else :
        re += 1;

print("AC x ",ac);
print("WA x ",wa);
print("TLE x ",tle);
print("RE x ",re);
# Judge status: Accepted
n,*a=map(int,open(0).read().split())
s=[0]
ans=10**20
for i in range(len(a)):
  s+=[a[i]+s[-1]]
for i in range(1,len(s)-1):
  ans=min(ans,abs(s[-1]-2*s[i]))
print(ans)
# Judge status: Wrong Answer
def fizz_buzz_sum(N):
  not_fizz_buzz = [i for i in range(N) if (i%3 != 0) and (i%5 != 0)]
  return sum(not_fizz_buzz)
# Judge status: Accepted
K,S = map(int, input().split())
count = 0
for i in range(K+1):
  for j in range(K+1):
    if 0 <= S-i-j <= K:
        count += 1
print(count)
# Judge status: Accepted
n = int(input())
s = list(map(str,input()))
ans = []
ans.append(0)
tmp = 0

for i in s:
    if i == "I":
        tmp += 1
        ans.append(tmp)
    else:
        tmp -= 1
        ans.append(tmp)
        
print(max(ans))
# Judge status: Accepted
x, y = map(int, input().split())
print('Yes' if sum(2*c + 4*(x - c) == y for c in range(x + 1)) else 'No')
# Judge status: Accepted
n = int(input())
def bub(x,l):
  if x == n:
    return [tuple(l)]
  ret = list()
  for i in range(1,n+1):
    if i not in l:
      ret += bub(x+1,l+[i])
  return ret
a = bub(0,list())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
print(abs(a.index(p) - a.index(q)))
# Judge status: Accepted
x, y = map(int,input().split())

cnt = 0
while True:
    if y >= x:
        cnt += 1
        y = y // 2
    else:
        print(cnt)
        exit()
# Judge status: Accepted
n = int(input())
a = list(map(int, input().split()))
s = 0
ans = 0
mo = 10 ** 9 + 7
for i in range(n):
    ans += s * a[i]
    s += a[i]
print(ans % mo)
# Judge status: Wrong Answer
N,M = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
for i in range(M):
    a = A.pop()
    a = a//2
    A.append(a)
    A.sort()
ans = sum(A)
# Judge status: Wrong Answer
n, x, t = list(map(int, input().split()))

print(n//x*t)
# Judge status: Accepted
n=int(input())
a=map(int,input().split())
ans=0
c=n+1
for i in a:
    c=min(i,c)
    if c==i:
        ans+=1
print(ans)
# Judge status: Accepted
n = int(input())
a = list(map(int, input().split()))
a.sort()

b = [True for i in range(a[-1]+1)]

ans = 0

for i, j in enumerate(a):
    if b[j]:
        t = 1
        while j*t < len(b):
            b[j*t] = False
            t += 1
        
        if i == n-1:
            ans += 1
        elif j != a[i+1]:
            ans += 1
        
print(ans)
# Judge status: Accepted
from collections import Counter

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

A.sort()

ans = 0
tmp = [True for i in range(A[-1] + 1)]

for i in range(N - 1):
    if tmp[A[i]]:
        if A[i + 1] != A[i]:
            ans += 1
        for j in range(A[i], A[-1] + 1, A[i]):
            tmp[j] = False
if tmp[A[-1]]:
    ans += 1
print(ans)
# Judge status: Accepted
N, K, S = map(int, input().split())

if S > 1:
    ans = [S for _ in range(K)] + [S-1 for _ in range(N-K)]
else:
    ans = [S for _ in range(K)] + [S+1 for _ in range(N-K)]
    
print(*ans)
# Judge status: Wrong Answer
a = list(input())

cnt = 0
for b in a:
  if b == 1:
    cnt+=1
    
print(cnt)
# Judge status: Accepted
n = int(input())
S = [int(input()) for _ in range(n)]
S.sort()

score = sum(S)
if score % 10 == 0:
    for s in S:
        if s % 10 != 0:
            score -= s
            break

print(0 if score % 10 == 0 else score)
# Judge status: Wrong Answer
a = int(''.join(input().split()))
if a % 4 == 0:
    print('Yes')
else:
    print('No')
# Judge status: Accepted
a,b = map(int,input().split())
T = 0

for n in range(1,b-a+1):
  T+=n

print(T-b)
# Judge status: Accepted
def main(n, r):
    if n >= 10:
        print(r)
    else:
        print(r + 100 * (10 - n))


if __name__ == "__main__":
    n, r = map(int, input().split())

    main(n, r)
# Judge status: Wrong Answer
a,b,c=map(int,input().split())
if a==b==c: print(1)
elif a==b or a==c: print(2)
else: print(3)
# Judge status: Accepted
#abc098_b
def compare(str1,str2):
    ans = 0
    str1=''.join(set(str1))
    str2=''.join(set(str2))
    for c in str1:
        ans += str2.count(c)

    return ans

N = int(input())
S = input()
m = 0
for i in range(N):
#    print(S[:i],S[i:])
    tmp = compare(S[:i],S[i:])
    if m < tmp:
        m=tmp
print(m)
# Judge status: Accepted
def solve():
    N = int(input())
    a = list(map(int,input().split()))
    b = list(map(int,input().split()))

    plus2_cnt = 0
    neg_cnt = 0
    for i in range(N):
        diff = b[i] - a[i]
        if diff >= 0:
            plus2_cnt += diff // 2
        else:
            neg_cnt += abs(diff)
    
    if plus2_cnt >= neg_cnt:
        print('Yes')
    else:
        print('No')
        
if __name__ == '__main__':
    solve()
# Judge status: Accepted
n = int(input())
a = [int(input()) for _ in range(n)]

lsts = []
temp = []
for aa in a:
    if aa == 0:
        if temp:
            lsts.append(temp)
            temp = []
    else:
        temp.append(aa)
if temp: lsts.append(temp)

ans = 0

for lst in lsts:
    for i, aa in enumerate(lst):
        ans += aa // 2
        if i != len(lst)-1:
            lst[i+1] -= aa % 2
            ans += aa % 2

print(ans)
# Judge status: Accepted
# import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial, gcd
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10 ** 7)
enu = enumerate
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep="\n")

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

val = (a+b+2-1)//2
print(val)
# Judge status: Accepted
n,x=map(int,input().split())
a=list(map(int,input().split()))
s=[0]*(n-1)
ans=0
if a[0]>x:
    ans+=a[0]-x
    a[0]=x
for i in range(n-1):
    s[i]=a[i]+a[i+1]
for i in range(n-2):
    if s[i]>x:
        t=s[i]-x
        s[i+1]-=t
        s[i]=x
        ans+=t
if s[n-2]>x:
    ans+=s[n-2]-x
print(ans)
# Judge status: Accepted
h = int(input())

ans = 0
cnt = 1
while h >= 1:
    ans += cnt
    h = h // 2
    cnt *= 2

print(ans)
# Judge status: Accepted
S = int(input())
x1 = 0
y1 = 0
x2 = 10**9
y2 = 1
x3 = (x2-S%x2)%x2
y3 = -(-S//x2)
print(x1,y1,x2,y2,x3,y3)
# Judge status: Accepted

def main():
    n = int(input())
    ai = list(map(int, input().split()))
    cnt = 0
    
    for i in range(n):
        if i != n-1:
            if ai[i] > ai[i+1]:
                cnt += ai[i]-ai[i+1]
                ai[i+1] = ai[i]
    print(cnt)
    
if __name__ == "__main__":
    main()
# Judge status: Wrong Answer
N,X = map(int,input().split())
Alist = list(map(int,input().split()))
for i in range(len(Alist)):
    Alist[i] = abs(Alist[i]-X)
Alist.sort()
p = 10**10
q = 1
for i in range(1,len(Alist)):
    if Alist[i] % Alist[0] != 0:
        p = min(p,Alist[i] % Alist[0])
        q = q*0
if len(Alist) > 1:
    if q == 0:
        print(p)
    else:
        print(Alist[0])
else:
    print(Alist[0])
# Judge status: Accepted
N = int(input())
A = list(map(int, input().split()))

check = 0

for a in A:
    check ^= a

ans = []

for a in A:
    ans.append(str(a ^ check))

print(" ".join(ans))
# Judge status: Wrong Answer
K, X = map(int, input().split())

# 黒い石の可能性がある座標をリスト化
array = []
i = 1
for i in range((K-1)*2+1):
    array.append(X-K+i)
    i += 1
ans = sorted(array)

print(*ans, sep="")
# Judge status: Wrong Answer
s = input()
if s[5::6] >= "04" and s[8::9] >= "30":
  print("Heisei")
else:
  print("TBD")
# Judge status: Accepted
S = input()
T = input()

if S == T[:len(S)]:
    print('Yes')
    exit()

print('No')
# Judge status: Wrong Answer
from sys import stdin,stdout
s,w=stdin.readline().strip().split()
s=int(s)
w=int(w)
if(s>=w):
    print("unsafe")
else:
    print("safe")
# Judge status: Accepted
n, x, t = map(int, input().split())
num = n // x
if n % x != 0:
    num += 1
print(t * num)
# Judge status: Accepted
n,*a=map(int,open(0).read().split())
ans=1
vec=0
for i in range(n-1):
    now=a[i+1]-a[i]
    if vec*now<0:
        ans+=1
        vec=0
    elif vec==0:
        vec=now
print(ans)
# Judge status: Accepted
n = input()[::-1]
dp = [[0, 0] for i in range(len(n) + 1)]
dp[0][1] = 1
for i in range(len(n)):
    dp[i + 1][0] = min(dp[i][0] + int(n[i]), dp[i][1] - int(n[i]) + 10)
    dp[i + 1][1] = min(dp[i][0] + int(n[i]) + 1, dp[i][1] - int(n[i]) + 9)
print(dp[len(n)][0])
# Judge status: Accepted
n, k = map(int, input().split())
a = list(map(int, input().split()))
if k >= sum(a)-n:
	print(1)
else:
	ok, ng = 10**9, 1
	while ok-ng > 1:
		mid = (ok+ng)//2
		if sum((x-1)//mid for x in a) <= k:
			ok = mid
		else:
			ng = mid
	print(ok)
# Judge status: Accepted
N, R = map(int, input().split())

if N >= 10:
  rate = R
else:
  rate = R + 100 * (10 - N)
  
print(rate)
# Judge status: Accepted
n = int(input())
ns = list(map(int, input().split()))
min_x = float('inf')
sum_x = 0
total_sum = sum(ns)
for i in range(n-1):
    sum_x += ns[i]
    min_x = min(min_x, abs(total_sum-2*sum_x))
print(min_x)
# Judge status: Wrong Answer
s = input()
if s == 'a' or 'i' or 'u' or 'e' or 'o':
  print('vowel')
else:
  print('consonant')
# Judge status: Accepted
#B
N = int(input())


AC = 0
WA = 0
TLE = 0
RE = 0
for _ in range(N):
    judge = input()
    if judge == 'AC':
        AC += 1
    elif judge == 'WA':
        WA += 1
    elif judge == 'TLE':
        TLE += 1
    elif judge == 'RE':
        RE += 1

print(f'AC x {AC}')
print(f'WA x {WA}')
print(f'TLE x {TLE}')
print(f'RE x {RE}')
# Judge status: Wrong Answer
n = int(input())
a = list(map(str, input().split()))

b = []
for i in range(n):
    if i%2 == 0:
        b.append(a[i])
    else:
        b.insert(0, a[i])
        
for i in b:
    print(i, end=' ')
# Judge status: Wrong Answer
a,b,c=input().split()
print("Yes" if a<=c and c<=b else "No")
# Judge status: Wrong Answer
import math

x = int(input())

for i in range(-10 ** 2 - 11, 10 ** 2 + 11):
    for j in range(-10 ** 2 - 11, 10 ** 2 + 11):
        if i <= j:
            continue
        if i ** 5 - j ** 5 == x:
            print(i, j)
            exit()
# Judge status: Wrong Answer
S = input()
K = int(input())

if S[0] == 1:
    print(S[1])
else:
    print(S[0])
# Judge status: Accepted
import math
H,A=map(int, input().split())
print(math.ceil (H/A))
# Judge status: Accepted
N, A, B = map(int, input().split())
d = N // (A + B)
m = N % (A + B)
print(d * A + min(m, A))
# Judge status: Accepted
X, Y, A, B, C = [int(_) for _ in input().split()]
P = [int(_) * 3 for _ in input().split()]
Q = [int(_) * 3 + 1 for _ in input().split()]
R = [int(_) * 3 + 2 for _ in input().split()]
S = sorted(P + Q + R)
cnt = [0, 0, 0]
ans = [0, 0, 0]
limit = [X, Y, 10**10]
while S:
    s = S.pop()
    q, r = divmod(s, 3)
    if cnt[r] >= limit[r]:
        continue
    cnt[r] += 1
    ans[r] += q
    if sum(cnt) == X + Y:
        print(sum(ans))
        exit()
# Judge status: Wrong Answer
n=int(input())
a,b=[0]*n,[0]*n
for i in range(n):
    a[i],b[i]=map(int,input().split())
a.sort()
b.sort()
if n&1:
    print(b[n//2]-a[n//2]+1)
else:
    print(1+(b[n//2]+a[n//2])-(b[(n-1)//2]+a[(n-1)//2]))
# Judge status: Accepted
N, A, B = list(map(int, input().split()))

diff = B - A

if diff % 2 == 0:
    ans = diff // 2
else:
    # d1 = A - 1
    # ans1 = d1 + (diff - 1) / 2 + 1

    # d2 = N - B
    # ans2 = d2 + (diff - 1) / 2 + 1

    ans = min(A-1, N-B) + 1 + (B - A - 1) // 2

print(ans)
# Judge status: Accepted
d = int(input())
base = 'Christmas'
print(base+' Eve'*(25-d))
# Judge status: Accepted
time = list(map(int, input().split()))
time.sort()
print(time[0] + time[1])
# Judge status: Wrong Answer
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

N, M = mapint()
if N>=M//2:
    print(N)
else:
    ans = N
    M -= N*2
    ans += M//4
    print(ans)
# Judge status: Accepted
n = int(input())

t = n
s = 0
while t - 500 >= 0:
  t = t - 500
  s = s + 1000
  
while t - 5 >= 0:
  t = t - 5
  s = s + 5
  
print(s)
# Judge status: Accepted
a = int(input())
if a%2 == 0:
    print(a//2)
else:
    print(a//2+1)
# Judge status: Accepted
N=int(input())
ans=1
while 2*ans<=N:
    ans*=2
print(ans)
# Judge status: Accepted
n,k=map(int,input().split())
a=list(map(int,input().split()))
#n,k=100000,100
#a=[i for i in range(100000)]

kl=[i for i in range(1,k+1)]

dp=[float("inf")]*(n)
dp[0]=0
for i in range(1,n):
  dp[i] = min(dp[j] + abs(a[i] - a[j]) for j in range(max(0, i - k), i))

print(dp[n-1])
# Judge status: Accepted
import heapq
N,M=map(int,input().split())
AB=[list(map(int,input().split())) for _ in range(N)]

AB.sort(reverse=True)
works=[]
heapq.heapify(works)
ans=0
AB=AB+[[0,0]]
for i in range(1,M+1):
  day=M-i
  latest=i
  while len(AB)>=2 and AB[-2][0]<=latest:
    a,b=AB.pop(-2)
    heapq.heappush(works,-b)
  if not works:
    continue
  ans-=heapq.heappop(works)

print(ans)
# Judge status: Accepted
n, l = map(int, input().split())

S = []
for i in range(n):
    S.append(input())

S = sorted(S)
print("".join(S))
# Judge status: Accepted
#設定
import sys
input = sys.stdin.buffer.readline

#ライブラリインポート
from collections import defaultdict

con = 10 ** 9 + 7
#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
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: Accepted
n=int(input())
if n>=64:
    print(64)
elif n>=32:
    print(32)
elif n>=16:
    print(16)
elif n>=8:
    print(8)
elif n>=4:
    print(4)
elif n>=2:
    print(2)
else:
    print(1)
# Judge status: Wrong Answer
a,b= map(int,input().split())
c = b//a
ans = 0
for i in range(10000):
    if 2**i <= c < 2**(i+1) :
        ans += i
print(a,b,c,ans +1)
# Judge status: Accepted
a,b=input().split()
n=int(a+b)
flg=0
for i in range(int(n**0.5)+1):
    if i**2==n:
        flg=1
print("Yes" if flg else "No")
# Judge status: Wrong Answer
a = input()

if(len(a)==6):
  if(a[2]==a[3]):
    if(a[4]==a[5]):
      print('Yes')
  else:
    print('No')
else:
  print('No')
# Judge status: Wrong Answer
import math
r=int(input())
area1=math.pi
arear=math.pi*r*r
ratio=int(arear/area1)
print(ratio)
# Judge status: Accepted
from math import log2, ceil
N, K = map(int, input().split())

ans = 0
j = 1.0
for x in range(N, 0, -1):
    if x >= K:
        ans += 1.0 * (1 / N)
    else:
        while x * j < K:
            j *= 2.0
        ans += (1.0 / j) * (1 / N)
print(ans)
# Judge status: Accepted
n = int(input())
a = [list(map(int, input().split(' '))) for _ in range(n - 1)]

for i in range(n):
    # from i
    # now = 1ループごとにnow
    now = 0
    for j in range(i, n - 1):
        (c, s, f) = a[j]
        if now <= s:
            now = s + c
        else:
            # matsu
            now = s + (now - s + f - 1) // f * f + c
    print(now)
# Judge status: Accepted
n = int(input())

a = [2**i for i in range(7)]
b = []
for i in a:
  if i <= n:
    b.append(i)
    
print(max(b))
# Judge status: Wrong Answer
from itertools import product
 
N = int(input())
S = [int(input()) for _ in range(N)]

T = [s for s in S if s % 10 != 0]

mmax = 0
for pair in product(range(2), repeat=len(T)):
  sum = 0
  for i in range(len(pair)):
    sum += S[i] * pair[i]
  if sum % 10 == 0:
    continue
  mmax = max(mmax, sum)

for s in S:
  if s % 10 == 0:
    mmax += s
print(mmax)