Harryxun/stf_run huggingface dataset:
# -*- coding: utf-8 -*-
# 整数の入力
n = int(input())
a = int(input())
# スペース区切りの整数の入力
# b, c = map(int, input().split())
# 文字列の入力
# s = input()
# # 出力
# print("{} {}".format(a+b+c, s))

if n < 500:
    if n > a:
        print('Yes')
    else:
        print('No')
else:    
    amari = n%500

    if amari =< a:
        print('Yes')
    else:
        print('No')

### FIXED CODE ###

# -*- coding: utf-8 -*-
# 整数の入力
n = int(input())
a = int(input())


if n < 500:
    if n <= a:
        print('Yes')
    else:
        print('No')
else:    
    amari = n%500
    if amari <= a:
        print('Yes')
    else:
        print('No')
n = int(input())
a = set()
for i in range(1,10):
  for j in range(1,10):
    a.append(i*j)
if n in a:
  print('Yes')
else:
  print('No')
    

### FIXED CODE ###

n = int(input())
a = []
for i in range(1,10):
  for j in range(1,10):
    a.append(i*j)
if n in a:
  print('Yes')
else:
  print('No')
s = list(input())
int pattern_a_count = 0
int pattern_b_count = 0

for index, value in enumerate(s):
  if index % 2 =0:
    if value == 0:
      pattern_a_count += 1
  if index % 2 =1:
    if value == 1:
      pattern_a_count += 1
      
for index, value in enumerate(s):
  if index % 2 =0:
    if value == 1:
      pattern_b_count += 1
  if index % 2 =1:
    if value == 0:
      pattern_b_count += 1
      
res = pattern_b_count
if pattern_a_count <= pattern_b_count:
  res = pattern_a_count
print(pattern_a_count)

### FIXED CODE ###

s = list(input())
pattern_a_count = 0
pattern_b_count = 0

# 1010パターン
for index, value in enumerate(s):
  if index % 2 == 0:
    if value == "0":
      pattern_a_count += 1
  if index % 2 == 1:
    if value == "1":
      pattern_a_count += 1

# 0101
for index, value in enumerate(s):
  if index % 2 == 0:
    if value == "1":
      pattern_b_count += 1
  if index % 2 == 1:
    if value == "0":
      pattern_b_count += 1
      
res = pattern_b_count
if pattern_a_count <= pattern_b_count:
  res = pattern_a_count
print(res)
a = input().split()
print(a[0][0] + a[1][0] + a[2][0])


### FIXED CODE ###

s = input()
t = ''
add_list = ['dream', 'dreamer', 'erase', 'eraser']
cur = len(s)
for i in range(len(s)):
    if s[-1 - i:cur] in add_list:
        cur = -1 - i
if -cur == len(s):
    print('YES')
else:
    print('NO')
S=input()
l=len(S)
dp=[[0 for i in range(13)] for j in range(l)]
mod=10**9+7

if S[0]=='?':
  for i in range(10):
    dp[0][i]=1
else:
  dp[int(S[0])]=1
for i in range(1,l):
  if S[i]=='?':
    for j in range(13):
      for k in range(10):
        dp[i][(10*j+k)%13]+=dp[i-1][j]%mod
  else:
    for j in range(13):
      dp[i][(10*j+int(S[i]))%13]+=dp[i-1][j]%mod

print(dp[l-1][5]%mod)

### FIXED CODE ###

S=input()
l=len(S)
dp=[0 for i in range(13)] 
mod=10**9+7
 
if S[0]=='?':
  for i in range(10):
    dp[i]=1
else:
  dp[int(S[0])]=1
  
for i in range(1,l):
  count=[0 for i in range(13)]
  if S[i]=='?':
    for j in range(13):
      for k in range(10):
        count[(10*j+k)%13]+=dp[j]%mod
  else:
    for j in range(13):
      count[(10*j+int(S[i]))%13]+=dp[j]%mod
  dp=count
 
print(dp[5]%mod)
#include <bits/stdc++.h>

using namespace std;

int main() {
	int a;
	cin>>a;
	string res;

	while (a != 0) {
		int rem=a%26;
		a/=26;
		char asciiChar=rem+97-1;
		res+=asciiChar;
	}

	reverse(res.begin(),res.end());
	cout<<res;
}

### FIXED CODE ###

N = int(input())
ans = ""

while N > 0:
	N -= 1
	ans += chr(ord('a') + N % 26)
	N //= 26

print(ans[::-1])
from math import pi
r = int(input())

area = r * r * pi
length = r * 2 * pi

print("{0:.6f}".format(area),end=' ')
print("{0:.6f}".format(length))

### FIXED CODE ###

import math
r = float(input())

area = r * r * math.pi
length = r * 2 * math.pi

print("{0:.6f}".format(area),end=' ')
print("{0:.6f}".format(length))
s = input()
if s == 'Sun':
  s = 0
elif s == 'MON':
  s = 1
elif s == 'TUE':
  s = 2
elif s == 'WED':
  s = 3
elif s =='THU':
  s = 4
elif s == 'FRI':
  s = 5
elif s == 'SAT':
  s = 6
print(s - 0)

### FIXED CODE ###

s = input()
if s == 'SUN':
  s = 7
elif s == 'MON':
  s = 6
elif s == 'TUE':
  s = 5
elif s == 'WED':
  s = 4
elif s =='THU':
  s = 3
elif s == 'FRI':
  s = 2
elif s == 'SAT':
  s = 1
print(s)
S = str(input())
T = str(input())
li = []
for i in string.ascii_lowercase:
    H = S + i
    li.append(H)
if T in li:
    print("Yes")
else:
    print("No")

### FIXED CODE ###

import string
S = str(input())
T = str(input())
li = []
for i in string.ascii_lowercase:
    H = S + i
    li.append(H)
print("Yes" if T in li else "No")
n,m=map(int,input().split())
a=list(map(int,input().split()))
A=a[0]
B=a[0]//2
from math import gcd
for i in range(n):
	A=A*a[i]//gcd(A,a[i])
	B=B*(a[i]//2)//gcd(B,a[i]//2)
	B//=A
m-=B
print(m//A+1)

### FIXED CODE ###

n,m=map(int,input().split())
a=list(map(int,input().split()))
from fractions import gcd
for i in range(n):
	a[i]//=2
from copy import copy
b=copy(a)
c=[]

for i in range(n):
	cnt=0
	while b[i]%2==0:
		cnt+=1
		b[i]//=2
	c.append(cnt)
for i in range(n-1):
	if c[i]!=c[i+1]:
		print(0)
		exit()

a_gcd=a[0]
for i in range(1,n):
	a_gcd=a_gcd*a[i]//gcd(a_gcd,a[i])
print((m+a_gcd)//(a_gcd*2))
n, k = map(int, input().split())
a = list(map(int, input().split()))

pole = 0
for i in range(n):
    if a[i] == 1:
        pole = i

l = pole
r = n - 1 - pole

for i in range(k - 1):
    if l % (k - 1) == i:
        if k - i - 1 >= r:
            if l == 0:
                print(0)
            else:
                print(1 + int(l / (k - 1)))
        else:
            if l == 0:
                print(1 + int((r - k + i + 1) / (k - 1)))
            else:
                print(1 + int(l / (k - 1)) + 1 + int((r - k + i + 1) / (k - 1)))

### FIXED CODE ###

s = input()
l = len(s)

p = 0
m = 0

for i in range(l):
    if s[i] == '+':
        p = p + 1
    else:
        m = m + 1

print(p - m)
price = 700

S = input()
if s[0] == 'o':
    price += 100
if s[1] == 'o':
    price += 100
if s[2] == 'o':
    price += 100
       
print (price)


### FIXED CODE ###

price = 700

s = input()
if s[0] == 'o':
    price += 100
if s[1] == 'o':
    price += 100
if s[2] == 'o':
    price += 100

print (price)
from collections import Counter as co
hit,te,ji=map(int,input().split())
l=list(co(sorted([int(input()) for u in range(hit)])).items())
inc=0
ans=0
ef=len(l)
for ix in range(hit):
  k,v=l[0]
  ans-=(-v//te)
  nokori=te-v%te if v%te else 0
  inc+=1
  while nokori:
    if l[inc][0]>k+ji:break
    if l[inc][1]<=nokori:
      nokori-=l[inc][1]
      inc+=1
      if inc==ef:break
    else:l[inc][1]-=nokori;break
  if inc==ef:break
print(ans+1 if nokori else ans)

### FIXED CODE ###

n,c,k=map(int,input().split())
ans=0
cnt=1
t=sorted([int(input())for s in range(n)])
while t:
    now=t.pop()
    ans+=1
    while t and cnt<c and t[-1]+k>=now:
        cnt+=1
        t.pop()
    cnt=1

print(ans)
n = int(input())
li = list(map(int,input().split()))
cnt = 0
i = -1
count = []
while True:
    if li[i] <= li[i-1]:
        cnt += 1
    else:
        count.append(cnt)
        cnt = 0
    i = i - 1
    if i == -n:
        count.append(cnt)
        break

print(max(count))

### FIXED CODE ###

n = int(input())
li = list(map(int,input().split()))
cnt = 0
ans = 0
for i in range(n-1):
    if li[i]>=li[i+1]:
        cnt+=1
    else:
        if cnt>ans:
            ans = cnt
        cnt = 0
if cnt>ans:
    ans = cnt
print(ans)
def num_divisors_table(n):
    table = [0] * (n + 1)
    
    for i in xrange(1, n + 1):
        for j in xrange(i, n + 1, i):
            table[j] += 1
    
    return table
  
n = int(input())  
a =  num_divisors_table(n)
ans = 0
for i in range(n+1):
  ans += i*a[i]
print(ans)  

### FIXED CODE ###

def num_divisors_table(n):
    table = [0] * (n + 1)
    
    for i in xrange(1, n + 1):
        for j in xrange(i, n + 1, i):
            table[j] += 1
    
    return table
  
n = int(input())  
a =  num_divisors_table(n)
ans = 0
for i in range(n+1):
  ans += i*a[i]
print(ans)
n=int(input())
abc = [list(map(int, input().split())) for i in range(n)]
#[[10,40,70],[20,50,80],[30,60,90]]
ABC=[[0,0,0]]
#A = [0]
#B = [0]
#C = [0]
for i in range(n):
  a = abc[i][0] + max(ABC[-1][1], ABC[-1][2])#10+max(0,0),20+max(40,70)=90,30+max(120,120)=150
  b = abc[i][1] + max(ABC[-1][0], ABC[-1][2])#40+max(0,0),50+max(10,70)=120,60+max(90,120)=180
  c = abc[i][2] + max(ABC[-1][0], ABC[-1][1])#70+mac(0,0),80+max(10,40)=120,90+max(90,120)=210
  ABC += [[a,b,c]]
  #A += [a]#0,10,90,150
  #B += [b]#0,40,120,180
  #C += [c]#0,70,120,210
print(max(ABC[-1])

### FIXED CODE ###

n=int(input())
abc = [list(map(int, input().split())) for i in range(n)]
#[[10,40,70],[20,50,80],[30,60,90]]
A = [0]
B = [0]
C = [0]
for i in range(n):
  a = abc[i][0] + max(B[-1], C[-1])#10+max(0,0),20+max(40,70)=90,30+max(120,120)=150
  b = abc[i][1] + max(A[-1], C[-1])#40+max(0,0),50+max(10,70)=120,60+max(90,120)=180
  c = abc[i][2] + max(A[-1], B[-1])#70+mac(0,0),80+max(10,40)=120,90+max(90,120)=210
  A += [a]#0,10,90,150
  B += [b]#0,40,120,180
  C += [c]#0,70,120,210
print(max(A[-1], B[-1], C[-1]))
import math
A = int(input())
B = int(input())
H = int(input())
M = int(input())
 
t = H * 60 + M
CC = A**2 + B **2 - 2 * A * B * math.cos(((pi/60)-(pi/360))*t)
print(c ** (1/2))

### FIXED CODE ###

import math
 
PI = math.pi
A, B, H, M = map(int, input().split())
 
arg_a = (float(H) + float(M)/60) / 12.0 * 360
arg_b = float(M) / 60.0 * 360
 
 
C = math.sqrt(A*A + B*B - 2*A*B* math.cos((arg_a-arg_b)/360*2*PI))
print(C)
a,b = map(int,input().split())

if a % 2 == 0 and b % 2 != 0:
	print('IMPOSSIBLE')
	exit()
if a % 2 != 0 and b % 2 == 0:
  	print('IMPOSSIBLE')
	exit()
print((a + b) // 2)


### FIXED CODE ###

a,b = map(int,input().split())
 
if a % 2 == 0 and b % 2 != 0:
  print('IMPOSSIBLE')
  exit()
if a % 2 != 0 and b % 2 == 0:
  print('IMPOSSIBLE')
  exit()
print((a + b) // 2)
import numpy as np
N,D=map(int,input().split())
A=0
for i in range(N):
  X,Y=map(int,input().split())
  d=np.linalg.norm(X-Y)
  if d<=D:
    A+=1
print(A)


### FIXED CODE ###

N,D=map(int,input().split())
X=0
for i in range(N):
  a,b = map(int,input().split())
  if ((a)**2+(b)**2)**0.5<=D:
    X+=1
print(X)
a,b = map(int.input())

c = a//b

print(c+1)


### FIXED CODE ###

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

c = a//(2*b+1)


if a % (2*b+1) ==0:
  print(c)
  
else:
  print(c+1)
a=int(input())
b=int(input())
c=a*b;d=(a+b)*2
print(c d)


### FIXED CODE ###

a,b=map(int,input().split())
print(a*b,(a+b)*2)
import itertools

h, w, k = map(int, input().split())
s = 0
l= []
for _ in range(h):
    a = list(map(int, input().split()))
    s += a.count("#")
    l.append(a)
if (k > s):
    print(0)
else:
    ans=0
    for pair in itertools.combinations([0, 1], h + w):
        hx = pair[:h]
        wx = pair[h + 1 :]
        if (sum(wx) == 0):
         ans=ans+1
    print(ans)

### FIXED CODE ###

  
import copy
from itertools import combinations
h, w, k = map(int, input().split())
c =[input() for i in range(h)]
ans = 0
y = []
for i in range(h):
    y.append(i)
x = []
for i in range(w):
    x.append(i)
for i in range(h+1):
    ty = list(combinations(y, i))
    for j in range(w+1):
        tx = list(combinations(x, j))
        for l in ty:
            for m in tx:
                cnt = 0
                for p in l:
                    for q in m:
                        if c[p][q] == '#':
                            cnt += 1
                if cnt == k:
                    ans += 1
print(ans)
s, w = map(int,input().split())
if w >= s:
    print('un',end='')
print('safe')


### FIXED CODE ###

s, w = map(int,input().split())
if w >= s:
    print('un',end='')
print('safe')
a,b,h,m=map(int, sys.stdin.readline().rstrip().split())
m_angle = m*6
h_angle = h*30+m/2
theta=abs(h_angle-m_angle)
if theta>180:theta=360-theta
c = a**2+b**2-2*a*b*math.cos(math.radians(theta))
print(c**0.5)


### FIXED CODE ###

import sys
import math

a,b,h,m=map(int, sys.stdin.readline().rstrip().split())
m_angle = m*6
h_angle = h*30+m/2
theta=abs(h_angle-m_angle)
if theta>180:theta=360-theta
c = a**2+b**2-2*a*b*math.cos(math.radians(theta))
print(c**0.5)
def fusion(xs):
    if len(xs) < 2:
        yield from xs
    elif xs[0] == xs[1]:
        yield from fusion(xs[1:])
    else:
        yield xs[0]
        yield from fusion(xs[1:])


N = input()
S = input()
print(sum(1 for _ in fusion(S)))


### FIXED CODE ###

N = int(input())
S = input()

count = 1
for i in range(N - 1):
    if S[i] != S[i + 1]:
        count += 1

print(count)
import sys 
sys.setrecursionlimit(10**9)
N = int(input())
G = [[] for _ in range(N)]
mod = 10**9+7
for _ in range(N-1):
    A, B = map(int, input().split())
    G[A-1].append(B-1)
    G[B-1].append(A-1)
cnt = [[] for _ in range(N)]
def dfs(p, v):
    s = 0
    for nv in G[v]:
        if nv == p:
            continue
        res = dfs(v, nv)
        cnt[v].append(res)
        s+=res
    cnt[v].append(N-s-1)
dfs(-1, 0) 


### FIXED CODE ###

import sys 
sys.setrecursionlimit(10**9)
N = int(input())
G = [[] for _ in range(N)]
mod = 10**9+7
for _ in range(N-1):
    A, B = map(int, input().split())
    G[A-1].append(B-1)
    G[B-1].append(A-1)
cnt = [[] for _ in range(N)]
que = [0]
depth = [-1]*N
depth[0] = 0
while que:
    v = que.pop()
    d = depth[v]
    for nv in G[v]:
        if depth[nv]>=0:
            continue
        depth[nv] = d+1
        que.append(nv)
d_to_i = [[] for _ in range(N)]
for i in range(N):
    d_to_i[depth[i]].append(i)
for d in range(N)[::-1]:
    for v in d_to_i[d]:
        for nv in G[v]:
            if depth[nv]<depth[v]:
                continue
            if cnt[nv]:
                cnt[v].append(sum(cnt[nv])+1)
            else:
                cnt[v].append(1)
for i in range(N):
    res = N-1
    for j in cnt[i]:
        res-=j
    cnt[i].append(res)
ans = 0
p = [1]*N
for i in range(1, N):
    p[i] = p[i-1]*2%mod
for v in range(N):
    if len(cnt[v])<=1:
        continue    
    res = p[N-1]-1
    for a in cnt[v]:
        res-=p[a]-1
    ans+=res
    ans%=mod
inv = pow(2, (mod-2)*N, mod)
print(ans*inv%mod)
n = int(input())
ans = [0 for i in range(1001)]
for x in range(1,100):
    for y in range(1,100):
        for z in range(1,100):
            if x*x + y*y + z*z + x*y + x*z + y*z < n:
                ans[x*x + y*y + z*z + x*y + x*z + y*z] += 1
            else:
              break
for i in range(1,n+1):
    print(ans[i])

### FIXED CODE ###

n = int(input())
ans = [0 for i in range(10001)]
for x in range(1,100):
    for y in range(1,100):
        for z in range(1,100):
            if x*x + y*y + z*z + x*y + x*z + y*z <= 10000:
                ans[x*x + y*y + z*z + x*y + x*z + y*z] += 1
            else:
              break
for i in range(1,n+1):
    print(ans[i])
x, a = map(int, input())
if 0 < a < x:
  print(0)
else:
  print(10)

### FIXED CODE ###

x, a = map(int, input().split())
if x < a:
    print(0)
else:
    print(10)
# -*- coding: utf-8 -*-
    import sys
    # ----------------------------------------------------------------
    # Use Solve Function
     
    def solve(lines):
        T,X = map(float, lines.pop(0).split(' '))
        print('{:.10f}'.format(T/X))
    #
    # main
    #
     
    # 1. use list instead of stdin
     
    # contents = '''\
    # 99 1\
    # '''
    # lines = contents.split('\n')
     
    # 2. use stdin
     
    lines = [x.strip() for x in sys.stdin.readlines()]
     
    #
    # solve !!
    #
    solve(lines)

### FIXED CODE ###

# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    T,X = map(float, lines.pop(0).split(' '))
    print('{:.10f}'.format(T/X))
#
# main
#

# 1. use list instead of stdin

# contents = '''\
# 99 1\
# '''
# lines = contents.split('\n')

# 2. use stdin

lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)
l =list(map(int,input().split()))
if l[0]+l[1]+[2]==17 and l[0]*l[1]*l[2]== 175:
  print('Yes')
else:
  print('No')

### FIXED CODE ###

a = list(int(x) for x in input().split())
if a == [5,5,7] or a == [5,7,5] or a == [7,5,5]:
  print('YES')
else:
  print('NO')
N,K=map(int,input())
B=[]
for i in range(K):
  D=int(input())
  A=list(map(int,input().split()))
  for j in A:
    B.append(j)
print(N-len(set(B)))

### FIXED CODE ###

N,K=map(int,input().split())
B=[]
for i in range(K):
  D=int(input())
  A=list(map(int,input().split()))
  for j in A:
    B.append(j)
print(N-len(set(B)))
import numpy as np
from sys import stdin
N,K=[int(x) for x in stdin.readline().rstrip().split()]
data=[]
for i in range(N):
    data.append([ 1 if x == "#" else 0 for x in list(input())])
data=np.array(data)
index_col=[]
for j in range(N):
    if sum(data[:,j]) == 0:
        index_col.append(j)
data=np.delete(data, index_col, 1)

index_row=[]
for k in range(K):
    if sum(data[k]) == 0:
        index_row.append(k)
data=np.delete(data,index_row,0)
for l in data:
    tmp=""
    for m in l:
        if m == 1:
            tmp=tmp+"#"
        else:
            tmp=tmp+"."
    print(tmp)

### FIXED CODE ###

import numpy as np
from sys import stdin
H,W=[int(x) for x in stdin.readline().rstrip().split()]
data=[]
for i in range(H):
    data.append([ 1 if x == "#" else 0 for x in list(input())])
data=np.array(data)
index_col=[]
for j in range(W):
    if sum(data[:,j]) == 0:
        index_col.append(j)
data=np.delete(data, index_col, 1)

index_row=[]
for k in range(H):
    if sum(data[k]) == 0:
        index_row.append(k)
data=np.delete(data,index_row,0)
for l in data:
    tmp=""
    for m in l:
        if m == 1:
            tmp=tmp+"#"
        else:
            tmp=tmp+"."
    print(tmp)
N = input()
 
s = "abcdefghijklmnopqrstuvwxyz"
m = 0
ans = ""
M,n = 0,0

for i in range(1,1000):
  m += 26**i
  if N <= m:
    M = N + 26**i　- m
    n = i-1
    break

for i in reversed(range(n+1)):
  a, b = divmod(M, 26**i)
  M = b
  ans = ans + s[a]

print(ans)

### FIXED CODE ###

N = int(input())

s = "abcdefghijklmnopqrstuvwxyz"
ans = ""
n, m = 0, 0

for i in range(1, 1000):
    m += 26 ** i
    if N <= m:
        n = i
        break

for i in range(n):
    a, b = divmod(N, 26)
    N = a
    if b == 0:
        ans += s[25]
        N -= 1
    else:
        ans += s[b-1]

ans1 = ''.join(list(reversed(ans)))
print(ans1)
n = int(input())
a = sorted(list(map(int, input().split())))
 
ans, limit = 1, 10**18
for x in a:
  ans = (ans if ans > limit else ans * x)

print(-1 if ans > limit else ans)

### FIXED CODE ###

print(eval(input().strip().replace(' ','*')))
contName = input().split()
print(''.join([contName[0][0],contName[1][0],contName[2][0]])

### FIXED CODE ###

# -*- coding: utf-8 -*-
contName = input().split()
print(contName[0][0]+contName[1][0]+contName[2][0])
n = int(input())
kugiri = [0,26,702,18278,475254,12356630,321272406,8353082582,217180147158,5646683826134]
ans = ""

for i in range(len(kugiri)):
    if n <= kugiri[i]:
        keta = i
        break
        
n -= kugiri[i-1]

for i in range(keta):
    moji = -(-n // 26**(keta-1))
    ans += chr(moji+96)
    n -= (moji-1) * 26**(keta-1)
    keta -= 1
    
print(ans)

### FIXED CODE ###

n = int(input())
kugiri = [0,26,702,18278,475254,12356630,321272406,8353082582,217180147158,5646683826134,146813779479510,3817158266467286]
ans = ""

for i in range(len(kugiri)):
    if n <= kugiri[i]:
        keta = i
        break
        
n -= kugiri[i-1]

for i in range(keta):
    moji = -(-n // 26**(keta-1))
    ans += chr(moji+96)
    n -= (moji-1) * 26**(keta-1)
    keta -= 1
    
print(ans)
from collections import defaultdict
N,M = (int(x) for x in input().split())
keta_num_str = [ (input().split()) for i in range(M) ]

#各桁をキー、数字を値の辞書にする
suuji = ""
num_str_dic = defaultdict(set)
kotae_dic ={ str(i):"0" for i in range(1,N + 1) } #　各桁に初期値”０”を入力
for i in keta_num_str:   
    num_str_dic[i[0]].add(i[1])


for i,v in num_str_dic.items():
    if 1 < len(v) : # 一つの桁に複数の値がある時はエラー
        kotae_dic ={}
        break

    else:
        kotae_dic[i] = list(v)

# 表示
if kotae_dic == {}: # 一つの桁に複数の値の時        
    print(-1)
else:
    kotae_dic_sorted = sorted(kotae_dic.items(),key=lambda x:int(x[0]))
    kotae_str = "".join( [i[1][0] for i in kotae_dic_sorted ] ) # 辞書の値を連結
    kotae_int =int(kotae_str)
    if kotae_int == 0: # "00"などはエラー
        print(-1)
    else:
        print(kotae_int)

### FIXED CODE ###

N = int(input())
import math
maisu = math.ceil(N/2)
print(maisu)
a, b, c, d = map(int,input().split())
if a + b > c + d:
  prtin("Left")

elif a + b < c + d:
  print("Right")

else:
  print("Balanced")


### FIXED CODE ###

a, b, c, d = map(int,input().split())
if a + b > c + d:
  print("Left")
 
elif a + b < c + d:
  print("Right")
 
else:
  print("Balanced")
import datetime
import string
import re
import math

aDic = {'ac': 0, 'wa': 0, 'tle': 0, 're': 0}

N = int(input())
for i in range(N):
    aDic[input()] += 1

for page in aDic:
    print(page + ' x ' + str(aDic[page]))


### FIXED CODE ###

import datetime
import string
import re
import math

aDic = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}

N = int(input())
for i in range(N):
    aDic[input()] += 1

for page in aDic:
    print(page + ' x ' + str(aDic[page]))
N = int(input())
A = list(map(int, input().split()))
dp = [0 for _ in range(N)]
A.sort()
A_max = A[-1]
p = A[0]
i = 0
while p**2 < A_max:
    if dp[i] < 2:
        p = A[i]
        for j in range(N):
            if dp[j] < 2 and A[j]%p == 0 and A[j] >= p:
                dp[j] += 1
    i += 1
cnt = 0
for i in range(N):
    if dp[i] == 1:
        cnt += 1

print(cnt)

### FIXED CODE ###

N = int(input())
A = list(map(int, input().split()))
# dp = [0 for _ in range(N)]

# A.sort()

# for i in range(N):
#     if dp[i] < 2:
#         p = A[i]
#         for j in range(N):
#             if dp[j] < 2 and A[j]%p == 0 and A[j] >= p:
#                 dp[j] += 1
# cnt = 0
# for i in range(N):
#     if dp[i] == 1:
#         cnt += 1
M = 10**6  + 5
cnt = [0 for _ in range(M)]
for x in A:
    if cnt[x] != 0:
        cnt[x] = 2
        continue
    i = x
    while i < M:
        cnt[i] += 1
        i += x
ans = 0
for x in A:
    if cnt[x] == 1:
        ans += 1
print(ans)