peterverebics/CodeNet_Python_428 huggingface dataset:
# Judge status: Accepted
a,b=map(int,input().split())
count=0
for i in range(a,b+1):
  n=str(i)
  if n[0]==n[4] and n[1]==n[3]:
    count+=1
    
print(count)
# Judge status: Wrong Answer
k = ['R','U','D']
g = ['L','U','D']

s = input()
for i in range(len(s)):
  if i%2 == 0:
    if not i in g:
      print("No")
      exit()
  else:
    if not i in k:
      print("No")
      exit()
print("Yes")
# Judge status: Wrong Answer
N=int(input())
H=list(map(int, input().split()))
cnt=0
ans=0
for i in range(N-1):
  if H[i+1]<=H[i]:
    cnt+=1
  else:
    ans=max(ans,cnt)    
    cnt=0
print(ans)
# Judge status: Accepted
a,b,k = map(int, input().split())

A = list(range(a,min(a+k,b+1)))
B = list(range(max(a,b-k+1),b+1))
ans = list(set(A)|set(B))
ans.sort()
for i in range(len(ans)):
  print(ans[i])
# Judge status: Wrong Answer
n, k, s = map(int, input().split())

if s < 10**9:
    ans = [s]*k + [s+1]
    print(*ans)
    exit()
if s == 10**9:
    if k != 0:
        ans = [s]*k + [1]*(n-k)
        print(*ans)
        exit()
    else:
        ans = [s-1]*n
        print(*ans)
        exit()
# Judge status: Accepted
import itertools

def dist(x1,y1,x2,y2):
    return ((x1-x2)**2+(y1-y2)**2)**0.5

def fact(n):
    ans=1
    for i in range(n):
        ans*=(i+1)
    return ans

n=int(input())
d=[[] for _ in range(n)]
for i in range(n):
    d[i]=list(map(int,input().split()))

ls=list(itertools.permutations(range(n)))
ans=0
for l in ls:
   for i in range(n-1):
       ans+=dist(d[l[i]][0],d[l[i]][1],d[l[i+1]][0],d[l[i+1]][1])
ans/=fact(n)
print(ans)
# Judge status: Accepted
S = input()

ans = "WA"

if S[0]=="A" and S[2:-1].count("C")==1:
    if S[1:].replace("C","c").islower():
        ans = "AC"

print(ans)
# Judge status: Accepted
import math
n,y = map(int,input().split())
c = 0
for a in range(n+1):
	for b in range(n+1):
		if 9000*a + 4000*b == y - 1000*n and n - a - b >= 0:
			print(*[a,b,n-a-b])
			c += 1
			break
	if c == 1:
		break
if c == 0:
	print(*[-1,-1,-1])
# Judge status: Accepted
X = int(input())
m = 100

cnt = 0
while True:
    cnt += 1
    m += m // 100
    if m >= X:
        print(cnt)
        break
# Judge status: Accepted
import bisect
N = int(input())
L = sorted([int(x) for x in input().split()])
cnt = 0
#print(L)
for i in range(N-2):
    for j in range(i+1, N-1):
        #print(i, j)
        #print(bisect.bisect_left(L, L[i]+L[j]))
        cnt +=  bisect.bisect_left(L, L[i]+L[j]) - (j+1)
print(cnt)
# Judge status: Accepted
import math
n, x, t = map(int, input().split())
for _ in range(1<<30):
  continue
print(math.ceil(n / x) * t)
# Judge status: Accepted
X = int(input())
ans = 0
i = 1
while ans < X:
    ans += i
    i += 1
print(i-1)
# Judge status: Accepted
K,A,B  = map(int, input().split())
n = (K-A+1)//2
if B-A < 2:
    print(1+K)
else:
    if (K-A+1)%2 == 0:
        print(A+(B-A)*n)
    else:
        print(A+(B-A)*n+1)
# Judge status: Accepted
n,k,*a=map(int,open(0).read().split())
for i in range(n,10**6):
    if all(str(j) not in str(i) for j in a):
        print(i)
        exit()
# Judge status: Accepted
import sys
input = sys.stdin.readline

n, x, y = map(int, input().split())
x, y = x-1, y-1
cnt = [0] * (n - 1)

for i in range(n):
    for j in range(i+1, n):
        a = abs(j-i)
        b = abs(x-i) + abs(y-j) + 1
        c = abs(y-i) + abs(x-j) + 1
        cnt[min(a,b,c) - 1] += 1

print(*cnt, sep="\n")
# Judge status: Accepted
import queue
N, M = map(int, input().split())
q=queue.Queue()
room=[['' for i in range(0)] for j in range(N+1)]
checkRoom=[0 for j in range(N+1)]
for i in range(M):
    A, B = map(int, input().split())
    room[A].append(B)
    room[B].append(A)
q.put(1)
while not q.empty():
    checkI=q.get()
    for j in range(len(room[checkI])):
        if checkRoom[room[checkI][j]]==0:
            q.put(room[checkI][j])
            checkRoom[room[checkI][j]]=checkI
print("Yes")
for i in range(2,N+1):
    print(checkRoom[i])
# Judge status: Accepted
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

min_a = 10**5
for i in range(A):
    if min_a > a[i]:
        min_a = a[i]

min_b = 10**5
for i in range(B):
    if min_b > b[i]:
        min_b = b[i]

min = min_a + min_b
#print(min)

for i in range(M):
    x, y, c = map(int, input().split())
    tmp = a[x - 1] + b[y - 1] - c
    if min > tmp:
        min = tmp

print(min)
# Judge status: Wrong Answer
x,n=map(int,input().split())
try:
  p=list(map(int,input().split()))
except:
  print(x)
  exit()
ans=float('inf')
for i in range(1,101):
  if i not in p:
    ans=min(ans,abs(x-i))
    
    
if x-ans not in p and (x-ans)>=0 and (x-ans)<=x:
  print(x-ans)
  
elif x-ans not in p and (x-ans)<=x:
  print(x+ans)
elif x-ans not in p and (x-ans)>=0:
  print(x-ans)
else:
  print(x+ans)
# Judge status: Wrong Answer
a,b,c=map(int,input().split())
k = int(input())
max_num = max(max(a, b), c)#a,b,cの中で一番大きな数が格納される
print(a+b+c+max(max(a, b), c)*k-k)
# Judge status: Accepted
N = int(input())
A = [0] + [int(n) for n in input().split()]
ans = [0]*N
for i in range(1, N):
    ans[A[i]-1] += 1
for i in range(N):
    print(ans[i])
# Judge status: Accepted
K,A,B=map(int,input().split())

ans_t=1+K
m=(K-A+1)
ans=1+(A-1)+(B-A)*(m//2)+m%2
    
print(max(ans,ans_t))
# Judge status: Wrong Answer
N=int(input())
T,A=map(int,input().split())
H=list(map(int,input().split()))
ans=0;m=100000000
for i in range(N):
    if abs(A-((T-H[i])*6)) < m:m=abs(A-((T-H[i])*6));ans=i+1
print(ans)
# Judge status: Accepted
n, m = map(int, input().split())
h = [0] + list(map(int, input().split()))
maxh = [0] * (n + 1)
for i in range(m):
	a, b = map(int, input().split())
	maxh[a] = max(maxh[a], h[b])
	maxh[b] = max(maxh[b], h[a])
	
cnt = 0
for i in range(1, n + 1):
	if h[i] > maxh[i]:
		cnt += 1
print(cnt)
# Judge status: Wrong Answer
N = int(input())
A = [int(input()) for _ in range(N)]
SA = list(reversed(sorted(set(A))))
l = len(SA)
if l == 1:
    for n in range(N):
        print(SA[0])
else:
    for a in A:
        for sa in SA:
            if a == sa:
                continue
            print(sa)
            break
# Judge status: Accepted
#ABC158-A
s=input()
if s!='AAA' and s!='BBB':
  print('Yes')
else:
  print('No')
# Judge status: Accepted
N, M, X, Y = map(int,input().split())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
if max(x) < min(y) and X < min(y) and max(x) < Y:
    print('No War')
else:
    print('War')
# Judge status: Accepted
import sys
input = sys.stdin.readline
def main():
    N = int(input())
    ans = 0
    for i in range(1, N+1):
        target = i
        current = 1
        while True:
            target = i * current
            current += 1
            if target > N:
                break
            ans += target
    print(ans)
if __name__ == "__main__":
    main()
# Judge status: Accepted
lst = list(map(int, input().split()))
print(len(set(lst)))
# Judge status: Accepted
n, a, b = map(int, input().split())
MOD = 10**9 + 7

u = [1]
d = [1]
c = [1]
for i in range(1, b+1):
    u.append(u[-1] * (n-i+1) % MOD)
    d.append(d[-1] * i % MOD)
    # c.append(u[-1] // d[-1] % MOD)
    c.append(u[-1] * pow(d[-1], MOD-2, MOD) % MOD)

print((pow(2, n, MOD) - c[a] - c[b] - 1) % MOD)
# Judge status: Wrong Answer
s, w = map(int, input().split())

if s < w:
    print("safe")
else:
    print("unsafe")
# Judge status: Accepted
a, b, c, d = map(int, input().split())

if (d < abs(a-c)):
  if(d < abs(a-b) or d < abs(b-c)):
    print("No")
  else:
    print("Yes")
else:
  print("Yes")
# Judge status: Wrong Answer
S = input()
if S[0]==S[1] and S[2]==S[3] and S[1]!=S[2]:
    print("Yes")
else:
    print("No")
# Judge status: Accepted
# AtCoder
N = list(input())
if '7' in N:
    print('Yes')
else:
    print('No')
# Judge status: Accepted
K,X = (int(x) for x in input().split())
print(' '.join(map(str,list(range(X-K+1,X+K)))))
# Judge status: Accepted
n = int(input())
p = list(map(int, input().split()))

cnt = 0
for i in range(n):
    if p[i] == i+1:
        if i+1 < n:
            p[i], p[i+1] = p[i+1], p[i]
        cnt += 1
print(cnt)
# Judge status: Wrong Answer
n,m,X,Y=map(int,input().split())
x=list(map(int,input().split()))
y=list(map(int,input().split()))
if min(y)<=X:
  print("War")
elif Y<=max(x):
  print("War")
else:
  if max(x)>min(y):
    print("War")
  else:
    print("No War")
# Judge status: Accepted
N, M = map(int ,input().split())

i = 1
A = []
B = []

while i*i <= M:
  if M % i == 0:
    A.append(i)
    B.append(M//i)
  i += 1 
    
for i in range(len(B)):
  if A[i] >= N:
    print(B[i])
    exit()
    
for i in range(len(A)-1,-1,-1):
  if B[i] >= N:
    print(A[i])
    exit()
# Judge status: Accepted
n = int(input())

d = {}
for i in range(n):
  s, p = input().split()
  d[s] = d.get(s, []) + [[i+1, int(p)]]

for key in sorted(list(d.keys())):
  for i in sorted(d[key], key = lambda x: x[1], reverse=True):
    print(i[0])
# Judge status: Accepted
n, m = map(int, input().split())
s = []
c = []
for i in range(m):
  S, C = map(int, input().split())
  s.append(S)
  c.append(C)
for i in range(10 **(n + 1)):
  tmp = str(i)
  if len(tmp) == n and all([tmp[s[j] - 1] == str(c[j]) for j in range(m)]):
    print(tmp)
    exit()
print(-1)
# Judge status: Accepted
n,c,k=map(int,input().split())
a=[int(input()) for _ in range(n)]

a.sort()
count=0
c_count=1
box=a[0]
for i in range(1,n):
    if c_count<c:
        if a[i]-box<=k:
            count+=1
            c_count+=1
        else:
            box=a[i]
            c_count=1
    else:
        box=a[i]
        c_count=1
    #print(count)
print(n-count)
# Judge status: Wrong Answer
A=[]
for i in range(3):
  A.append(list(map(int, input().split())))  

N = int(input())
B = []
for i in range(N):
  B.append(int(input()))

#print(A)
#print(B)

match = []
for A_line in A:
  match.append([(a in B) for a in A_line])

#print(match)
ans = False
# 横
for m in match:
  ans = ans or all(m)

# 縦
match_v = [[m[i] for m in match] for i in range(3)]
#print(match_v)
for m in match_v:
  ans = ans or all(m)
# 斜め
ans = ans or all([match[i][i] for i in range(3)])
ans = ans or all([match[2-i][i] for i in range(3)])

print(ans)
# Judge status: Accepted
[K, X] = list(map(int, input().split()))
sogaku = 500 * K
if sogaku < X:
  print('No')
else:
  print('Yes')
# Judge status: Accepted
import numpy as np
import sys
readline = sys.stdin.readline
read = sys.stdin.read

import bisect
n, q = map(int, readline().split())
s = readline().rstrip()
a = []
for i in range(len(s) - 1):
	if s[i] == 'A' and s[i + 1] == 'C':
		a.append(i)
for _ in range(q):
	l, r = map(int, readline().split())
	l -= 1
	r -= 2
	print(bisect.bisect_right(a, r) - bisect.bisect_left(a, l))
# Judge status: Wrong Answer
a,b,c = sorted(map(int,input().split()))

print(10*a+b+c)
# Judge status: Accepted
a = list(map(int, input().split()))
print(len(set(a)))
# Judge status: Accepted
def main():
    import sys
    n,*d=map(int,sys.stdin.buffer.read().split())
    e=[0]*n
    for i in d:
        e[i]+=1
    a=1 if d[0]<1 else 0
    for i in d[1:]:a=a*e[i-1]%998244353
    print(a)
main()
# Judge status: Wrong Answer
from collections import deque
n = int(input())
A = deque(map(int, input().split()))

cnt = 0
flag_empty = False
for i in range(1, n+1):
  if not i in A:
    while len(A) > 0:
      a = A.popleft()
      if a < i:
        cnt += 1
      else:
        cnt = -1
        break
    break
  while 1:
    a = A.popleft()
    if len(A) == 0: 
      flag_empty = True
      break
    if a != i:
      cnt += 1
    else:
      break
  if flag_empty:
    break
   
print(cnt)
# Judge status: Accepted
def solve():
    n = int(input())
    ans = 0
    while True:
        if n == 0:
            break
        if len(str(n)) % 2 == 1:
            ans += 1
        n -= 1
    print(ans)


solve()
# Judge status: Accepted
n=int(input())
a=list(map(int,input().split()))
a.sort(reverse=True)
A=a[::2]
B=a[1::2]
print(sum(A)-sum(B))
# Judge status: Accepted
#!/usr/bin/env python3
n = int(input())
if n % 2 > 0:
    print(0)
else:
    n //= 2
    c = 0
    while n > 0:
        c += n // 5
        n //= 5
    print(c)
# Judge status: Wrong Answer
s = list(input())
n = len(s)
a = s[:n//2]
b = list(reversed(s[(n+1)//2:]))
ans = 0
for i in range(n//2):
    ans += (a[i] == b[i])
print(ans)
# Judge status: Wrong Answer
import collections
n, m = map(int, input().split())
c = 0
B = []
C = []
for i in range(m):
    a, b = map(int, input().split())
    if a == 1:
        B.append(b)
    elif b == n:
        B.append(a)
C = collections.Counter(B)
for i in C:
    if C[i] > 1:
        print("POSSIBLE")
        exit()
print("IMPOSSOBLE")
# Judge status: Accepted
import math
n, k = [int(e) for e in input().split()]
sum = 0.0
for i in range(1, n+1):
  if i >= k:
    sum += 1.0
  else:
    sum += 0.5 ** math.ceil(math.log2(k/i))
print(sum / n)
# Judge status: Accepted
s = input()
if s[5] == "1":
    print("TBD")
elif s[6] == "4" or s[6] == "3" or s[6] == "2" or s[6] == "1":
    print("Heisei")
else:
    print("TBD")
# Judge status: Accepted
N, L = map(int, input().split())

taste_list = [L + i for i in range(N)]
taste_abs_list = [abs(n) for n in taste_list]
abs_min = min(taste_abs_list)
min_idx = taste_abs_list.index(abs_min)
total_sum = sum(taste_list)

ans = total_sum - taste_list[min_idx]
print(ans)
# Judge status: Wrong Answer
def solve():
    N = int(input())
    L0 = 2
    L1 = 1
    if N == 1:
        print(L1)
        exit()
    Li2 = L0
    Li1 = L1
    Li = Li1 + Li2
    for _ in range(N - 2):
        Li2 = Li1
        Li1 = Li
        Li = Li1 + Li2
        print(Li)
    print(Li)

if __name__ == "__main__":
    solve()
# Judge status: Accepted
from string import ascii_uppercase as alph


def main():
    N = int(input())
    S = input()
    result = ''
    alphabets = []
    for a in alph:
        alphabets.append(a)
    for s in S:
        result += alphabets[(alphabets.index(s) + N) % len(alphabets)]
    print(result)


if __name__ == '__main__':
    main()
# Judge status: Accepted
n = int(input())
d = [[0]*9 for _ in range(9)]
ans = 0

for num in range(1, n+1):
    s = str(num)
    x, y = int(s[0]), int(s[-1])
    if x != 0 and y != 0:
        d[x-1][y-1] += 1

for i in range(9):
    k = -1
    for j in range(9):
        if i == j:
            ans += pow(d[i][j], 2)
            k = 1
        elif k == 1:
            ans += 2*d[i][j]*d[j][i]

print(ans)
# Judge status: Accepted

n = int(input())
A = list(map(int,input().split()))
ans =1
for i in range(n):
    ans = ans * A[i]
    if ans  > 10**18:
        ans =-1
        break 
if 0 in A:
  print(0)
else:
  print(ans)
# Judge status: Accepted
#D 復習
n, a, b = map(int, input().split())
mod = 10 ** 9 + 7
whole_sum = pow(2, n, mod) - 1

def combinations_mod(n, k, mod):
    X, Y = 1, 1
    for i in range(1, k+1):
        X = (X * (n-i+1))%mod
    for j in range(1, k+1):
        Y = (Y*j)%mod
    result = X * (pow(Y, mod-2, mod))
    return result%mod

whole_sum -= combinations_mod(n, a, mod)
whole_sum -= combinations_mod(n, b, mod)

print(whole_sum % mod)
# Judge status: Wrong Answer
N = int(input())
L = list(map(int, input().split()))
A = [abs(sum(L[:i])-sum(L[i:]))for i in L]
print(min(A))
# Judge status: Accepted
N=int(input())

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

s=1000//A[0]
m=1000-s*A[0]
am=1000
for i in range(N-1):
  if A[i]<A[i+1]:
    am=m+A[i+1]*s
  else:
    s=am//A[i+1]
    m=am-A[i+1]*s
M=max([s*A[N-1]+m,am])
print(M)
# Judge status: Accepted
s = input()
num = len(s)
a = [0]*(num+1)

for i in range(num):
    if s[i] is '<':
        a[i+1] = max(a[i+1], a[i]+1)

for i in range(1, num+1):
    if s[-i] is '>':
        a[-(i+1)] = max(a[-(i+1)], a[-i]+1)
print(sum(a))
# Judge status: Accepted
from math import ceil, floor

def resolve():
  N = int(input())
  tax = 0.08

  if floor(ceil(N/(1+tax))*(1+tax)) == N:
    print(ceil(N/(1+tax)))
  else:
    print(":(")

if __name__ == "__main__":
  resolve()
# Judge status: Accepted
N = int(input())
P = list(map(int,input().split()))
ans = 0
for i in range(N):
    if i+1 == P[i]:
        if i+1 == N:
            P[i],P[i-1] = P[i-1],P[i]
        else:
            P[i],P[i+1] = P[i+1],P[i]
        ans += 1
print(ans)
# Judge status: Accepted
s = input()

prev = ""
lets = ""
ans = 0
for i in s:
  lets += i
  if lets != prev:
    ans += 1
    prev = lets
    lets = ""

print(ans)
# Judge status: Wrong Answer
a,b=map(int,input().split())
z = b // a 
x = b % a
if x==0:
    print(b//a)
elif z==0:
    print('1')
else:
    b -= a
    a -= 1
    y = b % a
    if y==0:
        print(1 + b//a)
    else:
        print(2 + b//a)
# Judge status: Accepted
n , m = input().split()
n , m = int(n) , int(m)

a = [0 for i in range (n)]

ans = 0
pnl = 0
ha = {}

for i in range (m) :
    p , s = input().split()
    p = int(p) - 1
    if s == 'WA' :
        a[p] += 1
    elif str(p) not in ha.keys() :
        ans += 1
        pnl += a[p]
        ha[str(p)] = '1'

print( str(ans) + ' ' + str(pnl))
# Judge status: Wrong Answer
n, k = map(int, input().split())
counter = 1
while n >= k:
    n = int(n / k)
    counter += 1
    print(n)
print(counter)
# Judge status: Wrong Answer
N = int(input())
A = list(map(int,input().split()))
ans = 1
re = 0

for i in range(2,N,1):
    #print(re)
    if re == 0:
        if A[i] <= A[i-1] <= A[i-2]:
            re = 0
        elif A[i-2] <= A[i-1] <= A[i]:
            re = 0
        else:
            ans += 1
            if A[i-1] != A[i]:
                re = 1
    else:
        re = 0
            


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

hako = [0]*n

for i in range(n,0,-1):
    tmp = i
    su = 0
    while tmp<=n:
        su += hako[tmp-1]
        tmp += i
    if su % 2 == a[i-1]:
        continue
    else:
        hako[i-1] = 1

print(hako.count(1))
for i in range(n):
    if hako[i] == 1:
        print(i+1,end=" ")
# Judge status: Accepted
n,m = map(int,input().split())
A = list(map(int,input().split()))
C = []
for _ in range(m):
  b,c = map(int,input().split())
  C.append((c,b))
C.sort(reverse = True)

count = 0
for c,b in C:
  A.extend([c for _ in range(b)])
  count += b
  if count > n:
    break
A.sort(reverse = True)

print(sum(A[:n]))
# Judge status: Wrong Answer
#import torch
#import torch.nn as nn
#import matplotlib.pyplot as plt
#from decimal import Decimal

#N=int(input())
A,V = map(float,input().split())
B,W = map(float,input().split())
T=int(input())
#A = list(map(int,input().split()))
#S=str(input())

if V<=W:
    print('NO')
else:
    L=abs(A-B)
    if L%(V-W)==0:
        if L//(V-W)<=T:
            print('YES')
        else:
            print('NO')
    else:
        print('NO')
# Judge status: Accepted
import math

N = int(input())
P = input().split()
Q = input().split()
X = [i+1 for i in range(N)]
Y = [i+1 for i in range(N)]

n = 1
m = 1
for i in range(N):
    for j in range(N-i):
        if int(P[i]) == X[j]:
            l = j
        if int(Q[i]) == Y[j]:
            k = j
    X.remove(int(P[i]))
    Y.remove(int(Q[i]))
    n += l*math.factorial(N-i-1)
    m += k*math.factorial(N-i-1)
    
print(abs(m-n))
# Judge status: Accepted
S = list(input())
Ncnt, Ecnt, Wcnt, Scnt = 0, 0, 0, 0

for i in S:
    if i == 'N':
        Ncnt += 1
    elif i == 'E':
        Ecnt += 1
    elif i == 'W':
        Wcnt += 1
    else:
        Scnt += 1

if (Ncnt > 0 and Scnt == 0) or (Scnt > 0 and Ncnt == 0) or (Ecnt > 0 and Wcnt == 0) or (Wcnt > 0 and Ecnt == 0):
    print('No')
else:
    print('Yes')
# Judge status: Accepted
import sys
input = sys.stdin.readline

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

def main():
    mod=10**9+7
    N,K=MI()
    A=LI()
    ans=[]
    for i in range(K,N):
        if A[i]>A[i-K]:
            ans.append("Yes")
        else:
            ans.append("No")
            
    for s in ans:
        print(s)

main()
# Judge status: Accepted
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
SumBefore = sum(A)
for i in range(N):
    A[i+1] = max(A[i+1] - max(B[i]-A[i],0) ,0)
    A[i] = max(A[i]-B[i],0)
SumAfter = sum(A)
print(SumBefore-SumAfter)
# Judge status: Wrong Answer
def main():
  N = int(input())
  def count(n):
    ret = 0
    i = 1
    while i*i <= n:
      if n % i == 0:
        ret += 1
        if i != n // i:
          ret += 1
      i += 1
    return ret


  ans = 1
  l[0] = True
  l[1] = True
  if N==1:
    print(ans)
  else:
    for i in range(2,N+1):
      x = count(i)
      ans += x * i

    print(ans)
# Judge status: Accepted
a,b=map(int,input().split())
print(0--a//b)
# Judge status: Accepted
#atcoder template
def main():
    #import sys
    #imput = sys.stdin.readline
    #ここにコード
    #input
    S = str(input())
    T = str(input())

    #output
    end_word = T[-1]
    if S + end_word == T:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()
# Judge status: Accepted
x=int(input())
if x==25:
    print("Christmas")
else:
    print("Christmas"+" Eve"*(25-x))
# Judge status: Accepted
a,b=map(int,input().split())
if a<=0 and b>=0:
    print("Zero")
elif a<0 and b<0:
    if abs(b-a)%2==0:
        print("Negative")
    else:
        print("Positive")
else:
    print("Positive")
# Judge status: Wrong Answer
X=int(input())

def is_prime(x):
    if x<=1:
        return False
    
    for i in range(2,int(-(-x**0.5//1))+1):
        if x%i==0:
            return False
    
    return True

p=X
while not is_prime(p):
    p+=1

print(p)
# Judge status: Accepted
from collections import Counter
n = int(input())
Si = [Counter(input()) for _ in range(n)]
letters = set(Si[0].keys())
for S in Si:
    letters = set(S.keys()) & letters
letters = list(letters)
letters.sort()
for key in letters:
    count = float('inf')
    for S in Si:
        count = min(count, S[key])
    print(key*count, end='')
print('')
# Judge status: Accepted
import string
abc = list(string.ascii_lowercase)

S = list(set(input()))
S.sort()

for i in range(26):
    if abc[i] in S:
        continue
    else:
        print(abc[i])
        exit()
print('None')
# Judge status: Wrong Answer
a = int(input().replace(" ", ""))
for i in range(1,101):
  if i == (a / i):
    print("Yes")
    break
else:
  print("No")
# Judge status: Wrong Answer
N=int(input())
S=input()
if N%2==0:
  if S[:N//2]==S[N//2:]:
    print('Yes')
else:
  print('No')
# Judge status: Wrong Answer
s, t = input(), input()

ls = len(s)
lt= len(t)
is_double = False

for i in range(0,lt):
  size = lt-i
  for j in range(0,lt-size+1):
    jps = (j+size)
    # 0 j (j+size) lt
    _t = t[j:jps]
    # print(i,j,size,_t, f'\t{s[j:ls-(lt-(j+size))]}')
    if _t in s[j:ls-(lt-(j+size))]:
      is_double = True
      break
  if is_double:
    print(i)
    break

if not is_double:
  print(lt)
# Judge status: Accepted
K, A, B = map(int, input().split())
if B-A <= 2:
    print(K+1)
    exit()

if A+1 > K:
    print(K+1)
elif (K-A-1)//2*(B-A)+(K-A-1)%2+(A-1)+(B-A)+1 > K+1:
    print((K-A-1)//2*(B-A)+(K-A-1)%2+(A-1)+(B-A)+1)
else:
    print(K+1)
# Judge status: Wrong Answer
# A == 10
# B == 2
# C == 1
#最後に50倍

a = int(input())
b = int(input())
c = int(input())
x = int(input())

x = x / 50
count = 0

for h in range(a +1):
    for i in range(b +1):
        for j in range(c +1):
            if a + b + c == x:
                count += 1
                
if a == b == c == 0:
    print(0)
else:
    print(count)
# Judge status: Accepted
n = int(input())
S_list = list(input())

rsum = 0
gsum = 0
bsum = 0

for s in S_list:
	if s == "R":
		rsum += 1
	elif s == "G":
		gsum += 1
	elif s == "B":
		bsum += 1

sum = rsum * gsum * bsum

for i in range(n-2):
	p = (n-i-1) // 2
	for j in range(1,p+1):
		if S_list[i] != S_list[i+j] and S_list[i+2*j]  != S_list[i+j] and S_list[i] != S_list[i+2*j]:
			sum -= 1

print(sum)
# Judge status: Accepted
N, C, K = map(int, input().split())
T = []
for _ in range(N):
    T.append(int(input()))
T = sorted(T)

ans = 0
c = 0
s = 0

for t in T:
    if (s != 0) and (s + K < t):
        s = 0
        c = 0
        ans += 1

    if s == 0:
        s = t
    c += 1

    if c == C:
        s = 0
        c = 0
        ans += 1
    #print(t, s, c, ans)

if s != 0:
    ans += 1

print(ans)