Harryxun/stf_run huggingface dataset:
#!/usr/bin/python3                                                                                                                                                                                          

import itertools

if __name__=='__main__':
    str = input()
    signs_comb = list(itertools.combinations_with_replacement([1, -1], 3))
    for signs in signs_comb:
        sum = int(str[0])
	for i in range(3):
            sum += signs[i] * int(str[i + 1])
        if sum == 7:
            sign_char = ['+' if i==1 else '-' for i in signs]
            break
    exp = str[0] + sign_char[0] + str[1] + sign_char[1] + str[2] + sign_char[2] + str[3] + '=7'
    print(exp)



### FIXED CODE ###

#!/usr/bin/python3                                                                                                                                                                                          

import itertools

if __name__=='__main__':
    str = input()
    signs_comb = list(itertools.product([1, -1], repeat=3))
    for signs in signs_comb:
        sum = int(str[0])
        for i in range(3):
            sum += signs[i] * int(str[i + 1])
        if sum == 7:
            sign_char = ['+' if i==1 else '-' for i in signs]
            break
    exp = str[0] + sign_char[0] + str[1] + sign_char[1] + str[2] + sign_char[2] + str[3] + '=7'
    print(exp)
n, k = [int(x) for x in input().strip().split()]
s = input().strip()
s[k-1:k] = s[k-1].lower()
print(s[:k-1]+s[k-1].lower()+s[k:])

### FIXED CODE ###

n, k = [int(x) for x in input().strip().split()]
s = input().strip()
print(s[:k-1]+s[k-1].lower()+s[k:])
H = raw_input().split()
W = raw_input().split()
for height in range(H):
    if height == H-1 or height == 0:
        print "#"*W
    else:
        print "#"+ "."*(W-2)+"#\n"

### FIXED CODE ###

while True:
    h,w = tuple([int(x) for x in raw_input().split(" ")])
    if h==0 and w==0: break
 
    for ih in range(h):
        if ih==0 or ih==h-1 or w <= 2: print "#" * w
        else: print "#" + "." * (w-2) + "#"
 
    print ""
i = input()
list1 = i.split()
tmpA = list1[0]
list1[0] = list1[1]
list1[1] = tmpA

tmpA = list1[0]
list1[0] = list1[2]
list1[2] = tmpA
print(list1[0] + " " + list1[1] + " " + list1[2]

### FIXED CODE ###

i = input()
list1 = i.split()
tmpA = list1[0]
list1[0] = list1[1]
list1[1] = tmpA

tmpA = list1[0]
list1[0] = list1[2]
list1[2] = tmpA
print(list1[0] + " " + list1[1] + " " + list1[2])
n, m = map(int, input().split())
s = [0]*m
c = [0]*m

for i in range(m):
  s[i], c[i] = map(int, input().split())

z = [0]*m
r = [0]*m
for i in range(m):
  r[s[i] - 1] = c[i]
  if s.count(s[i]) > 1:
    z[i] = i

if c[z[0]] != c[z[1]]:
  print(-1)
  exit()

if m >= 3:
  ans = r[0]*100 + r[1]*10 + r[2]*1
elif m == 2:
  ans = r[0]*10 + r[1]*1
else:
  ans = r[0]
print(ans)


### FIXED CODE ###

N, M = map(int,input().split())
sc = []
for _ in range(M):
    s, c = input().split()
    s = int(s)
    if s > N:
        print('-1')
        exit()
    sc.append([s, c])
 
ans = -1
if N == 1:
    start = 0
else:
    start = 10 ** (N - 1)
for i in range(start, 10 ** N):
    str_num = str(i)
    for s, c in sc:
        if str_num[s - 1] != c:
            break
    else:
        ans = i
        break
print(ans)
import math
print(math(factorial(n))%(10**9+7))

### FIXED CODE ###

import math
n=int(input())
print(math.factorial(n)%(10**9+7))
class Sequence:
    def __init__(self,num, seq):
        self.n = num
        self.sequence = seq

def LinearSearch(A, n, key):
    i=0
    A[n] = key
    while A[i] != key:
        i += 1
    if i==n:
        return "NOT_FOUND"
    return i

if __name__ == "__main__":
    with open("LinearSearch.txt") as fp:
        data = fp.readlines()

    x = data[1].split()
    x.append(" ")
    A = Sequence(int(data[0]), x)
    x = data[3].split()
    x.append(" ")
    B = Sequence(int(data[2]), x)

    C = []

    for i in range(B.n):
        res = LinearSearch(A.sequence, A.n, B.sequence[i])
        if res != "NOT_FOUND":
            C.append(A.sequence[res])

    print(C)

### FIXED CODE ###

class Sequence:
    def __init__(self,num, seq):
        self.n = num
        self.sequence = seq

def LinearSearch(A, n, key):
    i=0
    A[n] = key
    while A[i] != key:
        i += 1
    if i==n:
        return "NOT_FOUND"
    return i

if __name__ == "__main__":

    n = int(raw_input())
    x =	map(int, raw_input().split())
    x.append(" ")
    A = Sequence(n, x)
    n =	int(raw_input())
    x =	map(int, raw_input().split())
    x.append(" ")
    B = Sequence(n, x)

    C_num = 0

    for i in range(B.n):
        res = LinearSearch(A.sequence, A.n, B.sequence[i])
        if res != "NOT_FOUND":
            C_num += 1

    print(C_num)
N = int(input())
L = map(int, input().split())
sort(L)
sum = 0
for i in range(0,len(L),2):
    sum += L[i]
print(sum)

### FIXED CODE ###

N = int(input())
L = [int(x) for x in input().split()]
list.sort(L)
sum = 0
for i in range(0,len(L),2):
	sum += L[i]
print(sum)
S=list(input())
x=S.pop(0)
if x!='A':
  print('WA')
else:
  for i in range(1,len(S)-1):
    if S[i]=='C':
      del S[i]
      if str.islower("".join(S)):
        print('AC')
        break
      else:
        print('WA')
  else:
    print('WA')

### FIXED CODE ###

S=list(input())
x=S.pop(0)
if x!='A':
  print('WA')
else:
  for i in range(1,len(S)-1):
    if S[i]=='C':
      del S[i]
      if str.islower("".join(S)):
        print('AC')
        break
      else:
        print('WA')
        break
  else:
    print('WA')
s = input()

if s.count(a[0]) == 2 and s.count(a[1])==2 and s.count(a[2])==2:
    print("Yes")
else:
    print("No")

### FIXED CODE ###

s = input()

if s.count(s[0]) == 2 and s.count(s[1])==2 and s.count(s[2])==2:
    print("Yes")
else:
    print("No")
n = int(input())
s = [input() for _ in range(n)]
l = []
for i in s[0]:
    #print(i)
    if all(i in s[j] for j in range(n)):
    #print(l)
    
print("".join(sorted(l)))

### FIXED CODE ###

n = int(input())
s = [input() for _ in range(n)]
t = ""
for i in set(s[0]):
    #print(i)
    if all(i in s[j] for j in range(n)):
        t += i * min(s[k].count(i) for k in range(len(s)))
    #print(t)
    
print(''.join(sorted(t)))
import sys
from collections import Counter
from math import isinf


def warshall_floyd(matrix):
    """ ワーシャルフロイド
    :param matrix:  隣接行列(到達不能はfloat("inf"))
    :return matrix
    """
    # 到達不能をfloat("inf")にしておけば余計なチェックを入れなくても
    # inf > inf+(-1) のような到達不能＋負辺が繋がってしまうことはない
    V = len(matrix)  # 頂点数
    for i in range(V):
        for j, c2 in enumerate(row[i] for row in matrix):
            for k, (c1, c3) in enumerate(zip(matrix[j], matrix[i])):
                if c1 > c2+c3:
                    matrix[j][k] = c2+c3  # min(c1, c2+c3)
    return matrix


def init_matrix(V: int):
    """:param V: 頂点数
    """
    return [[float('inf')]*V for _ in range(V)]


H, W = map(int, input().split())
V = 10
matrix = init_matrix(V)
for i in range(10):
    c = map(int, input().split())
    for j, cj in enumerate(c):
        matrix[i][j] = cj

warshall_floyd(matrix)
costs = [matrix[i][1] for i in range(10)]

l = []
for _ in range(H):
    l.extend(list(map(int, input().split())))
c = Counter(l)
ans = 0


for k, v in c.items():
    if k == -1:
        continue
    ans += costs[k]*v
print(ans)


### FIXED CODE ###

S = input()
N = len(S)
ans = [0]*N
r_switch = []
l_switch = []
cur = S[0]
for i, si in enumerate(S):
    if si != cur:
        if cur == "R":
            r_switch.append(i-1)
        else:
            l_switch.append(i-1)
        cur = si

idx = 0
for i, si in enumerate(S):
    if si == "L":
        continue
    swi = r_switch[idx]
    if i >= swi:
        idx += 1
        if idx > len(r_switch):
            break
    if (swi - i) % 2 == 0:
        ans[swi] += 1
    else:
        ans[swi + 1] += 1


idx = -1
for i, si in enumerate(reversed(S)):
    i = N-i-1
    if si == "R":
        continue

    if i <= swi:
        idx -= 1
        if idx < -N:
            break
    swi = r_switch[idx]
    if (i - swi) % 2 == 0:
        ans[swi] += 1
    else:
        ans[swi+1] += 1
print(*ans, sep=" ")
# -*- coding:utf-8 -*-

while True:
    array = input().split()
    a, b = int(array[0]), int(array[1])
    
    x = a+b
    print(int(math.log10(x) + 1))

### FIXED CODE ###

# -*- coding:utf-8 -*-
import sys
import math

array =[]
for line in sys.stdin:
    array.append(line)
    
for i in range(len(array)):
    num = array[i].split(' ')
    a = int(num[0])
    b = int(num[1])
    n = a + b
    print(int(math.log10(n) + 1))
n=int(input())
a=[list(map(int,input().split())) for i in range(N)]
a.sort()
print(sum(a[0]))

### FIXED CODE ###

N=int(input())
a=[list(map(int,input().split())) for i in range(N)]
a.sort()
print(sum(a[-1]))
a, b = map(int,input().split())

d = a // b
r = a % b
f = float(a) / float(b)

print("{} {} {0:f}".format(d,r,f))

### FIXED CODE ###

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

d = a // b
r = a % b
f = a / b

print('{0} {1} {2:f}'.format(d,r,f))
n = input()
first = n // 100
second = (n % 100) // 10
third = (n % 10)

if (first == 7 or second == 7 or third == 7):
  print('YES')
else:
  print('No')

### FIXED CODE ###

n = int(input())
first = n // 100
second = (n % 100) // 10
third = (n % 10)

if (first == 7 or second == 7 or third == 7):
  print('Yes')
else:
  print('No')
N = int(input())

x_list=[]
y_list=[]
h_list=[]

def all_same(items):
	return all(map(lambda x: x == items[0], items))

for i in range(N):
	x,y,h=map(int, input().split())
	x_list.append(x)
	y_list.append(y)
	h_list.append(h)
		
for cy in range(101):
	for cx in range(101):
		i = -1	
		for h in h_list:
			i += 1
			if h >= 1:
				H = abs(cx - x_list[i])+abs(cy - y_list[i])+h
				break
		for i in range(N):
			h = max(H-abs(cx - x_list[i])-abs(cy - y_list[i]), 0)
			H_list.append(h) 
		if all_same(H_list):
			print(str(cx)+' '+str(cy)+' '+str(H))
			break		
	else:
		continue
	break

### FIXED CODE ###

N = int(input())

x_list=[]
y_list=[]
h_list=[]


def all_same(items):
	return all(map(lambda x: x == items[0], items))

for i in range(N):
	x,y,h=map(int, input().split())
	x_list.append(x)
	y_list.append(y)
	h_list.append(h)
		
for cy in range(101):
	for cx in range(101):
		n = -1	
		for h in h_list:
			n += 1
			if h >= 1:
				H = abs(cx - x_list[n])+abs(cy - y_list[n])+h
				h_now_list=[]
				break
		for i in range(N):
			h_now = max((H-abs(cx - x_list[i])-abs(cy - y_list[i])), 0)
			h_now_list.append(h_now)
			if h_now != h_list[i]:
				break	
			else:
				if len(h_now_list)==N:
					print(str(cx)+' '+str(cy)+' '+str(H))
					break
	else:
		continue
	break
from math import gcd

nm = input().split()
n = int(nm[0])
m = int(nm[1])
s = input()
t = input()
g = gcd(n,m)

ans = int(n*m / g)
for i in range(g):
    if s[(n//g)*i] != t[(m//g)*i]:
        ans = -1
            
print(ans)

### FIXED CODE ###

def gcd(a,b):
    while a%b != 0:
        a = a%b
        (a,b) = (b,a)
    return min(a,b)

nm = input().split()
n = int(nm[0])
m = int(nm[1])
s = input()
t = input()
g = gcd(m,n)

ans = int(n*m / g)
for i in range(g):
    if s[(n//g)*i] != t[(m//g)*i]:
        ans = -1
            
print(ans)
S = input()
T = input()

x = defaultdict(list)

for i, t in enumerate(T):
    x[t].append(S[i])

ok = True
for k, v in x.items():
    a = v[0]
    for c in v:
        if c != a:
            ok = False
            break
if ok:
    print("Yes")
else:
    print("No")


### FIXED CODE ###

import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
 
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

# map(int, input().split())

S = input()
T = input()

x = defaultdict(list)
y = defaultdict(list)

for i, t in enumerate(T):
    x[t].append(S[i])

for i, s in enumerate(S):
    y[s].append(T[i])

ok = True
for k, v in x.items():
    a = v[0]
    for c in v:
        if c != a:
            ok = False
            break

for k, v in y.items():
    a = v[0]
    for c in v:
        if c != a:
            ok = False
            break

if ok:
    print("Yes")
else:
    print("No")
N, M = map(int, input().split())
parents = [i for i in range(N+1)]

def find(x):
    if x == parents[x]:
        return x
    else:
        x = find(parents[x])
        return x
    
def same(x, y):
    if x==y:
        pass
    else:
        parents[x] = y

for _ in range(M):
    A, B = map(int, input().split())
    x, y = find(A), find(B)
    same(x, y)

print(len(set(parents)) - 2)

### FIXED CODE ###

N, M = map(int, input().split())
parents = [i for i in range(N+1)]

def find(x):
    if x == parents[x]:
        return x
    else:
        parents[x] = find(parents[x])
        return parents[x]
    
def same(A, B):
    x, y = find(A), find(B)
    if x==y:
        return
    else:
        parents[x] = y

for _ in range(M):
    A, B = map(int, input().split())
    same(A, B)
    
for i in range(N):
    find(i+1)

print(len(set(parents)) - 2)
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


from collections import defaultdict
n,k = map(int, input().split())
ns = defaultdict(set)
for _ in range(n-1):
    u,v = map(int, input().split())
    u -= 1
    v -= 1
    ns[u].add(v)
    ns[v].add(u)
def bfs(start):
    from queue import deque
    q = deque([start])
    seen = [None] * n
    seen[start] = 0
    dist = defaultdict(list)
    dist[0].append(start)
    while q:
        u = q.pop()
        d = seen[u]
        for v in ns[u]:
            if seen[v] is None and v not in done:
                seen[v] = d + 1
                dist[d+1].append(v)
                q.appendleft(v)
    return seen, dist
ans = 0
done = set()
while True:
    start = 0
    while start in done:
        start += 1
    seen, dist1 = bfs(start)
    m = max(item for item in seen if item is not None)
    u = dist1[m][0]
    seen, dist1 = bfs(u)
    mm = max(item for item in seen if item is not None)
    if mm<=k:
        break
    ans += 1
    v = dist[mm][0]
    seen, dist2 = bfs(v)
    if dist1[mm]<dist2[mm]:
        done.add(v)
    else:
        done.add(u)
print(ans)

### FIXED CODE ###

import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


from collections import defaultdict
n,k = map(int, input().split())
ns = defaultdict(set)
for _ in range(n-1):
    u,v = map(int, input().split())
    u -= 1
    v -= 1
    ns[u].add(v)
    ns[v].add(u)
def bfs(start):
    from queue import deque
    q = deque([start])
    seen = [None] * n
    seen[start] = 0
    dist = defaultdict(list)
    dist[0].append(start)
    while q:
        u = q.pop()
        d = seen[u]
        for v in ns[u]:
            if seen[v] is None and v not in done:
                seen[v] = d + 1
                dist[d+1].append(v)
                q.appendleft(v)
    return seen, dist
ans = 0
done = set()
while True:
    start = 0
    while start in done:
        start += 1
    seen, dist1 = bfs(start)
    m = max(item for item in seen if item is not None)
    u = dist1[m][0]
    seen, dist1 = bfs(u)
    mm = max(item for item in seen if item is not None)
    if mm<=k:
        break
    ans += 1
    v = dist1[mm][0]
    seen, dist2 = bfs(v)
    v1 = sum(len(dist1[u]) for u in range(k+1, mm+1))
    v2 = sum(len(dist2[u]) for u in range(k+1, mm+1))
    if v1<v2:
        done.add(v)
    else:
        done.add(u)
print(ans)
a, b, t = map(int, input().split())
print（b * (t // a))

### FIXED CODE ###

a, b, t = map(int, input().split())
print(b * (t // a))
n = int(input())
v = sorted(list(map(int, input().split())), reverse = False)
for i in range(1, n):
    v[0] = (v[0] + v[i]) / 2
print(v[0])

### FIXED CODE ###

a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print("red")
A,B = [int(i) for i in input().split(' ')]

0<=A
B<=10**9

if (A%2==0 AND B%2==0) OR (A%2 !=0 AND A%2 !=0):
  print((A+B)/2)
else:
  print('IMPOSSIBLE')

### FIXED CODE ###

A,B = [int(i) for i in input().split(' ')]

0<=A
B<=10**9

if (A+B)%2 == 0:
  print((A+B)//2)
else:
  print('IMPOSSIBLE')
n,a,b=list(map(int,input().split(' ')))
R=n//(a+b)
R2=(n%(a+b))%a
print(R*a+R2)

### FIXED CODE ###

n,a,b=list(map(int,input().split(' ')))
R=n//(a+b)
if (n%(a+b))-a>0:
    R2=a
else:
    R2=n%(a+b)
print(R*a+R2)
import numpy as np
while True:
    try:   
        a,b,c,d,e,f = (int(i) for i in input().split())
        x,y = (np.dot(np.linalg.inv(np.array([[a,b],[d,e]])),np.array([c,f]))[0],np.dot(np.linalg.inv(np.array([[a,b],[d,e]])),np.array([3,6]))[1])
        print(x,y)
    except:
        break

### FIXED CODE ###

while True:
    try:
        a,b,c,d,e,f = (int(i) for i in input().split())
        det=a*e-b*d
        x = (c*e-b*f)/det
        y = (a*f-c*d)/det
        if x==0:x=0
        if y==0:y=0
        print("{0:.3f} {1:.3f}".format(x,y))
    except EOFError:
        break
1<=R<=100
π=float(input(3.14))
Circle_Pond=2*R*π
print(Circle_Pond)

### FIXED CODE ###

import math
r=int(input())
print(2*r*math.pi)
N = int(input())
A = list([int(x) for x in input().split()])

max_money = 1000
stock = 0

for i in range(N-1):
    if A[i] < A[i+1]:
        stock += money // A[i]
        money -= money - A[i] * stock
    else:
        money += stock * A[i]
        stock = 0


print(max_money)


### FIXED CODE ###

N = int(input())
A = list([int(x) for x in input().split()])

money = 1000
stock = 0

for i in range(N-1):
    if A[i] <= A[i+1]:
        stock += money // A[i]
        money -= (money // A[i]) * A[i]
    else:
        money += A[i] * stock
        stock = 0

print(money + stock * A[N-1])
cnt = 0

while(True):
    
    if all(a % 2 == 0 for a in A):
        A = list(map(lambda x: x / 2, A))
        cnt += 1
    
    else: break

print(cnt)

### FIXED CODE ###

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

while(True):
    
    if all(a % 2 == 0 for a in A):
        A = list(map(lambda x: x / 2, A))
        cnt += 1
    
    else: break

print(cnt)
import math

n = math.sqrt(int(input()))
print(math.floor(n)**2)

### FIXED CODE ###

c = list(input())

if c[::-1] == list(input()):
    print('YES')
else:
    print('NO')
def binaryinsertion(A,x):
    left=0;right=len(A)-1;centre = len(A)//2
    while(True):
        if(right - left < 2):
            if(x[0]<A[left][0]):A.insert(left,x)
            else :
                if(x[0]<A[right][0]):A.insert(right,x)
                else:A.insert(right+1,x)
            break
        else:
            if(x[0] < A[centre][0]) :
                right = centre - 1
            elif(A[centre][0] < x[0]) :
                left = centre + 1
            else : 
                A.insert(centre,x)
                break
            centre = left + (right-left)//2

[N,L] = [int(x) for x in input().split()]
A = [[int(x),int(i)] for i,x in enumerate(input().split())]
sweep = A[:L]
sweep = sorted(sweep)
ans = [str(sweep[0][0])]
for i in range(L,N) :
    sweep.remove(A[i-L])
    binaryinsertion(sweep,A[i])
    ans.append(str(sweep[0][0]))
print(" ".join(ans))

### FIXED CODE ###

def ascend(a,b):
    mini = min(A[a:a+L])
    ans[a] = mini
    for i in range(a+1,b):
        if A[i+L-1] <= mini : mini = A[i+L-1]
        elif A[i-1] == mini : mini = min(A[i:i+L])
        ans[i] = mini

def descend(a,b):
    mini = min(A[b-1:b+L-1])
    ans[b-1] = mini
    for i in range(b-2,a-1,-1):
        if A[i] <= mini : mini = A[i]
        elif A[i+L] == mini: mini = min(A[i:i+L])
        ans[i] = mini
    
[N,L] = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
ans = [None]*(N-L+1)
count = 0;
if N > 10 ** 4:
    for i in range(100):
        if A[i+1] > A[i] : count += 1
    if count > 80 : descend(0, N-L+1)
    else : ascend(0,N-L+1)
else :
    ascend(0, N-L+1)
for i in ans[:-1] : print(i, end=" ")
print(ans[-1])
N, Q = map(int, input().split())
V = {i: [] for i in range(1,N+1)}
for _ in range(N-1):
    a, b = map(int, input().split())
    V[a].append(b)
    V[b].append(a)

C = {i: 0 for i in range(1,N+1)}

for _ in range(Q):
    p, x = map(int, input().split())
    C[p] += x


def propagate(u, p):
    for v in V[u]:
        if v == p:
            continue
        C[v] += C[u]
        propagate(v, u)

propagate(1, 0)

print(' '.join(str(C[i]) for i in range(1,N+1)))


### FIXED CODE ###

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

N, Q = map(int, input().split())
V = {i: [] for i in range(1,N+1)}
for _ in range(N-1):
    a, b = map(int, input().split())
    V[a].append(b)
    V[b].append(a)

C = {i: 0 for i in range(1,N+1)}

for _ in range(Q):
    p, x = map(int, input().split())
    C[p] += x


def propagate(u, p):
    for v in V[u]:
        if v == p:
            continue
        C[v] += C[u]
        propagate(v, u)

propagate(1, 0)

print(' '.join(str(C[i]) for i in range(1,N+1)))
import numpy as np
import math

n=int(input())

A=np.empty((n))
B=np.zeros((n))

count=0

for i in range(n):
    A[i]=int(input())

##print(A)


for i in range(n):
    if A[i]==1:
        B[i]=1
        ##print("ifの1")
    elif A[i]!=2 and A[i]%2==0:
        B[i]=1
        ##print("ifの2")
    else:
        for j in range(2,int(math.sqrt(A[i]))+1):
           ##print("j",j)
            if A[i]%j==0:
                B[i]=1
                break
        ##print("ifの3")
                


for i in range(n):
    if B[i]==0:
        count=count+1



print(count)




### FIXED CODE ###

from math import sqrt

n=int(input())

count=0

for i in range(n):
    x=int(input())
    if x==1:
        count=count+1
    elif x!=2 and x%2==0:
        count=count+1
    elif x==2 or x==3 or x==5:
        count=count
    else:
        for j in range(2,int(sqrt(x))+1): 
            if x%j==0:
                count=count+1
                break


print(n-count)
a,b,k=map(int,input().split())
r=range(a,b+1)
for i in sorted(set(r[:k])|set(r[-k:])):print(i)#setで重複を避ける、リストの[:k]と[-k:]の範囲を得る


### FIXED CODE ###

s=list(input())
if(s.count('a')==1 and s.count('b')==1 and s.count('c')==1):
  print('Yes')
else:print('No')
k = int(input())
s = input()
n = len(s)
MOD = 10**9+7
ans = 0

def cmb(n, r, MOD):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % MOD

N = 10 ** 6
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
 
for i in range(2, N + 1):
    fact.append((fact[-1] * i) % MOD)
    inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
    factinv.append((factinv[-1] * inv[-1]) % MOD)

for i in range(k+1):
    b = pow(26, k-i, MOD)
    b *= pow(25, i, MOD)
    b *= cmb(i+n-1, n-1, MOD)
    ans += (b % MOD)
    
print(ans%MOD)

### FIXED CODE ###

k = int(input())
s = input()
n = len(s)
MOD = 10**9+7
ans = 0

fact = [1] * 2200000
invfact = [1] * 2200000
 
for i in range(1, 2200000):
    fact[i] = fact[i-1] * i % MOD
 
invfact[2200000 - 1] = pow(fact[2200000 - 1], MOD-2, MOD)
 
for i in range(2200000-1, 0, -1):
    invfact[i-1] = invfact[i] * i % MOD

def comb(n, k):
    return fact[n] * invfact[k] * invfact[n-k] % MOD

for i in range(k+1):
    b = pow(26, k-i, MOD)
    b *= pow(25, i, MOD)
    b *= comb(i+n-1, n-1)
    ans += (b % MOD)
    
print(ans%MOD)
N = int(input("Enter the number: "))
M = int(input("Enter the number "))
if N == M:
    print("yes")
else:
    print("No")
    

### FIXED CODE ###

n,m = map(int, input().split())
print('Yes' if n==m else 'No')
if S[0:2]=='hi':
    print('Yes')
else:
    print('No')

### FIXED CODE ###

S = input()
S2 = ['hi', 'hihi', 'hihihi', 'hihihihi', 'hihihihihi']

if S in S2:
    print('Yes')
else:
    print('No')
S = input()
work=list(S)
i=0
cout=0
while(True):
    if(i==len(work)-1):
        break
    if(work[i]==work[i+1]):
        i+=1
    else:
        cout+=2
        del work[i]
        del work[i]
        i=0

    

print(len(S)-len(work))

### FIXED CODE ###


S = input()
work=list(S)
i=0
o_cout=0
z_cout=0
for x in work:
    if(x=='1'):
        o_cout+=1
    else:
        z_cout+=1
    
if(o_cout>z_cout):
    cout=z_cout
else:
    cout=o_cout
    

print(cout*2)
n = int(input())
count = 0
 
for i in range(1,n+1):
  if len(i)//2 != 1:
    count += 1
 
print(count)

### FIXED CODE ###

n = int(input())
count = 0
 
for i in range(1,n+1):
  if len(str(i))%2 == 1:
    count += 1
 
print(count)