Harryxun/stf_run huggingface dataset:
s = list(input())
K = int(input())
l = []
l2 = []
l3 = []
l4 = []

for i in range(len(s)):
    s[i] = str(ord(s[i])-ord("a")+11)

for i in range(len(s)):
    tmp = ''
    for j in range(i, len(s)):
        tmp += s[j]
        l.append(tmp)

for i in range(len(l)):
    while True:
        if len(l[i]) == len(s)*2: break
        l[i] += '0'

for i in l:
    is_multi = 0
    i = int(i)
    for j in l2:
        if i == j:
            is_multi = 1
    if is_multi == 0:
        l2.append(i)

l2.sort()

l2 = list(str(l2[K-1]))

tmp = ''
for i in range(len(l2)):
    if l2[i] != '0':
        tmp += l2[i]

l3 = list(tmp)
if len(l3) % 2 == 1:
    l3.append('0')

i = 0
while i < len(l3)-1:
    tmp = chr(int(l3[i] + l3[i+1]) - 11 + ord('a'))
    l4.append(tmp)
    i += 2

ans =''
for i in range(len(l4)):
    ans += l4[i]


print(ans)


### FIXED CODE ###

s = list(input())
K = int(input())

l =[]

for i in range(len(s)):
    tmp = ''
    for j in range(i, len(s)):
        if j > i + 4: break
        tmp += s[j]
        l.append(tmp)
l.sort()

l2 = []
for x in l:
    if len(l2) > 6:
        break
    if x not in l2:
        l2.append(x)


ans = l2[K - 1]

print(ans)
# 解説 https://betrue12.hateblo.jp/entry/2019/03/17/011847

from collections import defaultdict

mod = 10 ** 9 + 7

N = int(input())
C = [int(input()) for _ in range(N)]
dp = [0] * (N + 1)
dp[0] = 1

for i in range(1, N):
    if C[i] == C[i - 1]:
        dp[i] = dp[i - 1]
    else:
        max_k = -1
        for k in range(i - 1):
            if C[k] == C[i]:
                max_k = max(max_k, k)
        if max_k == -1:
            dp[i] = dp[i - 1]
        else:
            dp[i] = dp[i - 1] + dp[max_k]

print(dp[N - 1])y


### FIXED CODE ###

# 解説 https://betrue12.hateblo.jp/entry/2019/03/17/011847
# from collections import defaultdict

mod = 10 ** 9 + 7

N = int(input())
C = [int(input()) for _ in range(N)]
# L = [-1] * (N + 10)  # 出たところ
# dp = [-1] * (N + 10)
# dp[0] = 1
L  = [-1] * (2*10**5 + 10)
dp = [-1] * (2*10**5 + 10)
dp[0] = 1
 

for i in range(N):
    if L[C[i]] == -1:
        dp[i + 1] = dp[i]
    elif C[i] == C[i - 1]:
        dp[i + 1] = dp[i]
    else:
        dp[i + 1] = dp[i] + dp[L[C[i]]]
    
    dp[i + 1] %= mod
    L[C[i]] = i + 1

print(dp[N])
X,Y=int(input().split())
print((X+Y)//2)

### FIXED CODE ###

X,Y=map(int,input().split())
print(X+Y//2)
N = int(input())
flag = 0

for i in range(1, 10):
    if (N % i) == 0 and (N // i) < 10:
        print('Yes')
        break

else:
    print('No')


### FIXED CODE ###

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

if A > 9 or B > 9:
    print('-1')
else:
    print(A*B)
N = str(input())
print()
hon = [2,4,5,7,9]
pon = [0,1,6,8]
bon = [3]

if hon in int(N[len(N)-1]):
  print(

### FIXED CODE ###

N = str(input())
hon = ["2","4","5","7","9"]
pon = ["0","1","6","8"]
bon = ["3"]
if N[len(N)-1] in hon:
  print("hon")
elif N[len(N)-1] in pon:
  print("pon")
elif N[len(N)-1] in bon:
  print("bon")
A, B = map(int, input().split())

if A > B:
  for i in range(A):
    k = abs(A-i)
    l = abs(B-i)
    if k == l:
      print(i)
  else:
    print('IMPOSSIBLE')

if A < B:
  for in in range(B):
    k = abs(A-i)
    l = abs(B-i)
    if k == l:
      print(i)
  else:
    print('IMPOSSIBLE')

### FIXED CODE ###

A, B = map(int, input().split())
 
if (A + B)%2 == 0:
  k = (A + B)/2
  print(round(k))
else:
  print('IMPOSSIBLE')
import math

n=int(input())

#最小公倍数を定義
def lcm(x,y):
    return (x*y)//math.gcd(x,y)

print(lcm(n,2))


### FIXED CODE ###

N = int(input())
if N % 2 == 0:
  print(N)
else:
  print(N*2)
n= int(input())
if n%2==0:print(n/2)
elif n=1:print(1)
else:print((n//2 +1)/n)

### FIXED CODE ###

n= int(input())
if n%2==0:print(0.5)
elif n==1:print(1.0)
else:print((n//2 +1)/n)
s,t = map(str,input().split())
a,b = map(int,input().split())
u = input()
if u == s:
  a -= 1
elif u == t:
  t -= 1 
print('{0} {1}'.format(a,b))


### FIXED CODE ###

s,t = input().split()
a,b = map(int,input().split())
u = input()
if u == s:
  a -= 1
elif u == t:
  b -= 1
print('{0} {1}'.format(a,b))
n, total = map(int, input().split())

x=0
y=0
z=0

while True:
  found = False

  while True:
    z = n - x - y
    sum = 10000 * x + 5000 * y + 1000 * z
    if sum == total
      found = True
      break
    elif sum >  total
      break
    y =+ 1

  if found ==  True
    break
  if 10000 * x > total
    x = -1
    y = -1
    z = -1
    break
  x += 1

print("{} {} {}".format(x, y, z))

### FIXED CODE ###

n, total = map(int, input().split())

x=0
y=0
z=0

found = False
for i in range(int(total / 10000 + 1)):
  x = i
  for j in range(int((total - 10000 * i) / 5000 + 1)):
    y = j
    z = n - x - y
    sum = 10000 * x + 5000 * y + 1000 * z
    if sum == total:
      found = True
      break

  if found == True:
    break

if found == False:
  x = -1
  y = -1
  z = -1

print("{} {} {}".format(x, y, z))
#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    scanf("%d",&n);
    vector<int> h(n);
    for(int &x:h)
    {
        scanf("%d",&x);
    }
    vector<int> dp(n);
    dp[0]=0;
    dp[1]=abs(h[1]-h[0]);
    for(int i=2;i<n;i++)
    {
        dp[i]=min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]));

    }

   cout<<dp[n-1];

    return 0;
}


### FIXED CODE ###

n=int(input())
a= list(map(int,input().split()))
from collections import defaultdict as dd
dp=dd(int)

dp[1]=0
dp[2]=abs(a[0]-a[1])

for i in range(3,n+1):
    dp[i]=min(abs(a[i-1]-a[i-2])+dp[i-1],abs(a[i-1]-a[i-3])+dp[i-2])
print(dp[n])
A, B, C, D = map(int, input().split())

import numpy as np

from_1_a = int((A-1)/C) +int((A-1)/D) - int((A-1)/np.lcm(C,D))
from_1_b = int(B/C) +int(B/D) - int(B/np.lcm(C,D))

baisu_c_or_d = from_1_b -from_1_a
among = B -A  +1

print(among - baisu_c_or_d)

### FIXED CODE ###

from fractions import gcd

A, B, C, D = map(int, input().split())
l = C * D // gcd(C, D)
x = (A - 1) - (A - 1) // C - (A - 1) // D + (A - 1) // l
y = B - B // C - B // D + B // l
print(y - x)
import data
data = [int(i) for i in input().split()]

data.sort()
print("{0}{1}{2}".format(data[0],data[1],data[2]))

### FIXED CODE ###

data = [int(i) for i in input().split()]

data.sort()
print("{0} {1} {2}".format(data[0],data[1],data[2]))
a=int(input())
b=int(input())
print(max(a+b,a-b,a*b))


### FIXED CODE ###

l=list(map(int,input().split()))
a=l[0]
b=l[1]
print(max(a+b,a-b,a*b))
import sys

def solve():
    while True:
        try:
            a, b = map(int, sys.stdin.readline().split())
            c = a + b

            if c == 0:
                print(1)
            else:
                ans = 0

                while c > 0:
                    ans += 1
                    c //= 10

                print(ans)
                
        except EOFError:
            return

if __name__ == '__main__':
    solve()

### FIXED CODE ###

import sys

def solve():
    for line in sys.stdin:
        a, b = map(int, line.split())

        c = a + b

        if c == 0:
            print(1)
        else:
            ans = 0

            while c > 0:
                ans += 1
                c //= 10

            print(ans)

if __name__ == '__main__':
    solve()
s = input().strip()
t = input().strip()

ti = 0
si = 0
tl = len(t)
sl = len(s)
count = 0
found = False
while ti < tl:
	if s[si] == t[ti]:
#		print(s[si])
		si += 1
		ti += 1
		found = True
	else:
		si += 1
		if si == sl:
			if not found:
				count = -1
				break
			si = 0
			found = False
	count += 1
print(count)


### FIXED CODE ###

a_code = ord("a")

s = [ord(c) - a_code for c in input().strip()]
t = [ord(c) - a_code for c in input().strip()]

tl = len(t)
sl = len(s)

s_table = [None] * sl
index_table = [None] * 26
for i in range(sl - 1, -1, -1):
	c = s[i]
	index_table[c] = i
	s_table[i] = list(index_table)

ti = 0
si = 0
count = 0
found = False
while ti < tl:
	c = t[ti]
	index = s_table[si][c]
	if index != None:
		ti += 1
		count += index + 1 - si
		si = index + 1
		found = True
		if si >= sl:
			if not found:
				count = -1
				break
			found = False
			si = 0
	else:
		if not found:
			count = -1
			break
		found = False
		count += sl - si
		si = 0
print(count)
N,M = map(int,input().split())
ab = {}
for i in range(N):
    a,b = map(int,input().split())
    ab[a] = b

keys = sorted(ab.keys())

ans = 0
honsu = 0
money = 0
for i in keys:
    if honsu >= M:
        break
    ans += ab[i] * i
    honsu += ab[i]
    if honsu >= M:
        money = i
        break

for j in range(ab[money]):
    if honsu == M:
        break
    honsu -= 1
    ans -= money

print(ans)


### FIXED CODE ###

N,M = map(int,input().split())
ab = {}
for i in range(N):
    a,b = map(int,input().split())
    if a in ab.keys():
        ab[a] += b
        continue
    ab[a] = b

keys = sorted(ab.keys())

ans = 0
kosu = 0
for k in keys:
    kosu += ab[k]
    if kosu >= M:
        kosu -= ab[k]
        break
    ans += k * ab[k]

for i in range(ab[k]):
    if kosu == M:
        break
    kosu += 1
    ans += k
print(ans)
def main():
    n, m = map(int, input().split())
    ans = [0]*n
    for _ in range(m):
        s, c = map(int, input().split())
        if ans[s-1] == 0:
            ans[s-1] = c
        elif ans[s-1] != 0 and ans[s-1] != c:
            print(-1)
            exit()

    if len(ans[0]) == 1:
        print(*ans, sep="")
    if ans[0] == 0:
        print(-1)
    else:
        print(*ans, sep="")


if __name__ == "__main__":
    main()


### FIXED CODE ###

def main():
    n, m = map(int, input().split())
    ans = [-1]*n
    for _ in range(m):
        s, c = map(int, input().split())
        if ans[s-1] == -1:
            ans[s-1] = c
        elif ans[s-1] != -1 and ans[s-1] != c:
            print(-1)
            exit()

    if n == 1:
        if ans[0] == -1:
            ans[0] = 0
    else:
        if ans[0] == 0:
            print(-1)
            exit()

        if ans[0] == -1:
            ans[0] = 1

        for i in range(1, n):
            if ans[i] == -1:
                ans[i] = 0
    print(*ans, sep="")


if __name__ == "__main__":
    main()
r = (int)raw_input()

s = math.pi*r*r
l = 2.0*math.pi*r

print s, l

### FIXED CODE ###

import math

r = float(input())

s = math.pi * r**2
l = 2.0*math.pi*r

print(s, l)
N = int(input())
A = int(input())
B = int(input())
ans_list = []

for i in range(0,N+1):
    if i < 10:
        if i >= A and i <=B:
            ans_list.append(i)
    else:
        temp = list(map(int,str(i)))
        temp = temp[0]+temp[1]
        if temp >=A and temp<=B:
            ans_list.append(i)
            
print(sum(ans_list))

### FIXED CODE ###

N,A,B = map(int,input().split())
ans_list = []

for i in range(0,N+1):
    if i < 10:
        if i >= A and i <=B:
            ans_list.append(i)
    else:
        temp = list(map(int,str(i)))
        temp=sum(temp)
        if temp >=A and temp<=B:
            ans_list.append(i)
            
print(sum(ans_list))
n = int(input())

print(180*r-360)

### FIXED CODE ###

n = int(input())
 
print(180*n-360)
import numpy as np

P_MOD = 1000000007


def solve(S):
    # print(S)
    # 1, 10, 100, 1000, ... を 13 で割った値は 1, 10, 9, 12, 3, 4 で巡回する
    MODS = np.array([1, 10, 9, 12, 3, 4], dtype=np.int)

    # 現在の桁の余り N の状態を cur[N]
    # 直前の桁の余り N の状態を priv[N] とする
    priv = np.zeros(13, dtype=np.int)
    priv[0] = 1
    s = S[::-1]
    for i in range(0, len(s)):
        cur = np.zeros(13+13, dtype=np.int)
        d = s[i]
        if d == '?':
            for di in range(10):
                m = (di * MODS[i % 6]) % 13
                cur[m:m+13] = (cur[m:m+13] + priv[0:13]) % P_MOD
            cur[0:13] += cur[13:26]
        else:
            m = (int(d) * MODS[i % 6]) % 13
            cur[m:m+13] = priv[0:13]
            cur[0:13] += cur[13:26]
        priv = cur
    return cur[5]


if __name__ == '__main__':
    S = input()

    ans = solve(S)

    print(ans % P_MOD)


### FIXED CODE ###


P_MOD = 1000000007


def solve(S):
    # print(S)
    # 1, 10, 100, 1000, ... を 13 で割った値は 1, 10, 9, 12, 3, 4 で巡回する
    MODS = [1, 10, 9, 12, 3, 4]

    # 現在の桁の余り N の状態を cur[N]
    # 直前の桁の余り N の状態を priv[N] とする
    priv = [1] + [0] * 12
    # print(priv)
    s = S[::-1]
    for i in range(0, len(s)):
        cur = [0] * 13
        d = s[i]
        # print('i=', i, 'd=', d)
        if d == '?':
            for j in range(13):
                for di in range(10):
                    m = di * MODS[i % 6]
                    cur[(j+m) % 13] += priv[j]
        else:
            m = int(d) * MODS[i % 6]
            for j in range(13):
                cur[(m+j) % 13] = priv[j]
        # print(cur)
        for j in range(13):
            priv[j] = cur[j] % P_MOD
    return cur[5]


if __name__ == '__main__':
    S = input()

    ans = solve(S)

    print(ans % P_MOD)
import math
a, b = map(int, input().split())
ans = math.floor(a * b)
print(ans)


### FIXED CODE ###

#import math
from decimal import *
# 小数を制御

a, b = map(str, input().split())
a = int(a)
b = Decimal(b)
#ans = math.floor(a * b)
ans = a * b
ans1 = int(ans)
print(ans1)
print(*input().split(',')

### FIXED CODE ###

a,b,c = input().split(",")
print(a, b, c)
# coding: utf-8
length,question = map(int, input().split())
string = input()
e = [[int(i) for i in input().split()] for i in range(question)]
c = 0
tmp = []

for i in e:
    s = ''
    for j in range(i[0],i[1]+1):
        s+=string[j-1]
    
    for n in range(len(s)):
        if s[n:n+2] == "AC":
            c+=1

    print(c)
    c = 0


### FIXED CODE ###

i = input()
if i == "A":
    print("T")
elif i == "C":
    print("G")
elif i == "G":
    print("C")
elif i == "T":
    print("A")
s = str(input())
t = str(input())
s = (sorted(s))
t = (sorted(t,reverse = True))
s2 = ''.join(s)
t2 = ''.join(t)

if s2 < t2:
    print('Yes')
else:
    print('No')

### FIXED CODE ###

import math
a,b = map(int,input().split())
x = (a + b)/2
print(math.ceil(x))
N = input()
A = map(int, input.split(' '))    
bit = 0
for a in A:
    bit |= a
print(len(bit) - len(bit.rstrip('0')))

### FIXED CODE ###

n = input()
a = list(map(int, input().split()))
cnt = 0
while all(i%2==0 for i in a):
    a = [i/2 for i in a]
    cnt += 1
print(cnt)
import math

N,K = map(int, input().split())

ans1 = N - K + 1
ans2 = ans1 * (ans1 - 1)
ans3 = 1

# combination(N,K)を求める
for i in range(K):
    ans3 *= (N - i)

ans3 = int(ans3 / math.factorial(K) - ans1 - ans2 )

print(ans1 % (10**9 + 7))
print(ans2 % (10**9 + 7))
print(ans3 % (10**9 + 7))

### FIXED CODE ###

from scipy.misc import comb

N,K = map(int, input().split())

red_ball_count = N - K

for i in range(1, K + 1):
    if red_ball_count + 1 - i < 0:
        print(0)
    else:
        print(comb(red_ball_count + 1, i, exact=True) * comb(K - 1, i - 1, exact=True) % (10**9 + 7))
n,k = map(int,input().splt())
s = list(input())
s[k-1] = s[k-1].lower()
s ="".join(s)
print(s)

### FIXED CODE ###

n,k = map(int,input().split())
s = list(input())
s[k-1] = s[k-1].lower()
s ="".join(s)
print(s)
from fractions import gcd


N, M = map(int, input().split())
S = input()
T = input()
LCM = N * M // gcd(N, M)
S_dist = [""] * LCM
T_dist = [""] * LCM
for i in range(N):
    S_dist[i * LCM // N] = S[i]
for i in range(M):
    T_dist[i * LCM // M] = T[i]
for s, t in zip(S_dist, T_dist):
    if s != "" and t != "" and s != t:
        print(-1)
        break
else:
    print(LCM)


### FIXED CODE ###

from fractions import gcd


N, M = map(int, input().split())
S = input()
T = input()
g = gcd(N, M)
N //= g
M //= g
for i in range(g):
    if S[i * N] != T[i * M]:
        print(-1)
        break
else:
    print(N * M * g)
N = int(input())
S = input()

ans = ""

for x in range(S)
	num=(ord(x) + N)
  	if(num >=90):
    	num=64+num%90
    ans += chr(num)
print(ans)


### FIXED CODE ###

n = int(input())
s = input()
n_s = ""
for i in range(len(s)):
    if ord(s[i])+n > 90:
        n_s+=chr(ord(s[i])+n-26)
    else:
        n_s+=chr(ord(s[i])+n)
    
print(n_s)
N, K = map(int, input().split())
A = set()
for _ in range(K):
  d = int(input())
  A.add(list(input().split()))
print(N - len(A))


### FIXED CODE ###

N, K = map(int, input().split())
A = set()
for _ in range(K):
  d = int(input())
  A.update(list(map(int, input().split())))
print(N - len(A))
s = input()
t = input()
for i in range(len(s)):
    if s[i] != t[-i-1]:
        flag = false
if flag:
    print("Yes")
else:
    print("No")

### FIXED CODE ###

s = input()
t = input()
flag = False
for i in range(len(s)):
    if s == t:
        flag =True
    s = s[-1] + s[0:len(s)-1]
if flag:
    print("Yes")
else:
    print("No")
s = list(input())
K = int(input())
l = []
l2 = []
l3 = []
l4 = []

for i in range(len(s)):
    s[i] = str(ord(s[i])-ord("a")+11)

for i in range(len(s)):
    tmp = ''
    for j in range(i, len(s)):
        tmp += s[j]
        l.append(tmp)

for i in range(len(l)):
    while True:
        if len(l[i]) == len(s)*2: break
        l[i] += '0'

for i in l:
    is_multi = 0
    i = int(i)
    for j in l2:
        if i == j:
            is_multi = 1
    if is_multi == 0:
        l2.append(i)

l2.sort()
l2 = list(str(l2[K]))

tmp = ''
for i in range(len(l2)):
    if l2[i] != '0':
        tmp += l2[i]

l3 = list(tmp)

i = 0
while i < len(l3):
    tmp = chr(int(l3[i] + l3[i+1]) - 11 + ord('a'))
    l4.append(tmp)
    i += 2

ans =''
for i in range(len(l4)):
    ans += l4[i]


print(ans)


### FIXED CODE ###

s = list(input())
K = int(input())

l =[]

for i in range(len(s)):
    tmp = ''
    for j in range(i, len(s)):
        if j > i + 4: break
        tmp += s[j]
        l.append(tmp)
l.sort()

l2 = []
for x in l:
    if len(l2) > 6:
        break
    if x not in l2:
        l2.append(x)


ans = l2[K - 1]

print(ans)
w = input()

ans = {}
for i in w:
  if i in ans:
    ans[i] += 1
  else:
    ans[i] = 1

if all[i % 2 == 0 for i in ans.values()]:
  print('Yes')
else:
  print('No')

### FIXED CODE ###

w = input()

ans = {}
for i in w:
  if i in ans:
    ans[i] += 1
  else:
    ans[i] = 1

if all([i % 2 == 0 for i in ans.values()]):
  print('Yes')
else:
  print('No')
a, b, k = map(int, input().split())
li =[]

for i in range(1, a):
    if a % i == 0:
        li.append(i)
    else:
        continue

for i in range(1, b):
    if b % i == 0:
        li.append(i)
    else:
        continue

li2 =[]
for n in range(len(li)):
    if li.count(li[n]) == 2:
        li[n] = num
        li2.append(num)
        li.remove(num)
        li.remove(num)
    else:
        continue

li2.sort(reverse=True)
print(li2[k-1])

### FIXED CODE ###

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

def ooo(x):
    lix =[]
    for i in range(1, x+1):
        if x % i == 0:
            lix.append(i)
    return lix

lia = ooo(a)
lib = ooo(b)
li = lia + lib

li2 =[]
for n in range(len(li)):
    if not li[n] in li2: 
        if li.count(li[n]) == 2:
            li2.append(li[n])

li2.sort(reverse=True)
print(li2[k-1])
a, b = map(int, input().split())
if (a*b) % 2:
  print('Odd')
  else:
    print('Even')

### FIXED CODE ###

a, b = map(int, input().split())
if (a*b) % 2:
    print("Odd")
else:
    print("Even")
#整数の入力
a,b = int(input()split())
#コインの枚数をXとする
X = int()
X = 0
if a>=b:
X = X + a
a = a - 1
else:
  X = X + b
  b = b - 1
  
print(X)

### FIXED CODE ###

def Y(flag):
    if flag:
        print('YES')
    else:
        print('NO')
 
def y(flag):
    if flag:
        print('Yes')
    else:
        print('No')
 
a,b = map(int,input().split())
l = [a,b,a-1,b-1]
l = sorted(l)
print(l[-1] + l[-2])
import numpy as np

N, M = [int(x) for x in input().split()]
H = [int(x) for x in input().split()]
mat = np.zeros((N, N))
for j in range(M):
    a, b = [int(x) for x in input().split()]
    if mat[a - 1, b - 1] == 0:
        mat[a - 1, b - 1] = H[b - 1]
        mat[b - 1, a - 1] = H[a - 1]

count = 0
for i in range(N):
    h = H[i]
    max_h = np.max(mat[i,:])
    if h > max_h:
        count += 1
print(count)

### FIXED CODE ###

N, M = [int(x) for x in input().split()]
H = [int(x) for x in input().split()]
nodes = [1 for i in range(N)]
for j in range(M):
    a, b = [int(x) for x in input().split()]
    if H[a - 1] <= H[b - 1]:
        nodes[a - 1] = 0
    if H[b - 1] <= H[a - 1]:
        nodes[b - 1] = 0
print(sum(nodes))
N = int(input())
S = list(input())
i = 0
count = 0
while i <= N-1:
    while S[i] == S[i+1]:
      i += 1
    count +=1
    i +=1
    if i == N-1:
      count += 1
      break
print(count)

### FIXED CODE ###

N = int(input())
S = list(input())
i = 0
count = 0
while i < N-1:
    while S[i] == S[i+1]:
      i += 1
      if i == N-1:
        break
    if i == N-1:
      break
    count +=1
    i +=1
count +=1
print(count)
N = int(input())
root = int(N**0.5)
print(min([i + N //i -2 for i in range(1, root+1) if N % i == 0])

### FIXED CODE ###

A, B = map(int,input().split())
ans = A*B if (1 <= A <= 9) and (1 <= B <= 9) else -1
print(ans)
else:
    if b == 1:
        print(a)
    elif b == 3:
        d = '9' * (b // 2)
        '0'.join(d)
        d = int(d + '0')
        print(c - d)
    elif b > 3:
        d = '9' * (b // 2)
        '0'.join(d)
        d = int(d + '1')
        print(c - d)

### FIXED CODE ###

a = input()
b = len(list(a))
c = int(a)
d = ''

if b % 2 == 0:
    d = '9' * (b // 2)
    print('0'.join(d))

else:
    if b == 1:
        print(a)
    else:
        d = '9' * (b // 2)
        d = '0'.join(d)
        d = int(d + '0')
        print(c - d)
import fractions
mod=10**9+7
n=int(input())
a=list(map(int,input().split()))

count=a[0]
for i in range(n-1):
    count=count*a[i+1]//fraction.gcd(x, y)
ans=0
for i in range(n):
    ansa=count//a[i]
    ans+=ansa
    ans%=mod
print(ans)

### FIXED CODE ###

import fractions
mod=10**9+7
n=int(input())
a=list(map(int,input().split()))

def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)

count=a[0]
for i in range(n-1):
    count=lcm(count,a[i+1])
ans=0
for i in range(n):
    ansa=count//a[i]
    ans+=ansa
    
print(ans%mod)
N = int(input())
A = [int(i) for i in input().split()]
A = sorted(A,reverse=True)
ans = a[0]
if n==2:
    print(ans)
else:
    a = a[1]
    for i in range(N-2):
        idx = i//2
        ans += a[idx]
    print(ans)

### FIXED CODE ###

N = int(input())
A = [int(i) for i in input().split()]
A = sorted(A,reverse=True)
ans = A[0]
if N==2:
    print(ans)
else:
    A = A[1:]
    for i in range(N-2):
        idx = i//2
        ans += A[idx]
    print(ans)
n=int(input())
a=[[]for i in range(n)]
for i in range(n-1):
    c,d=map(int,input().split())
    a[c-1].append([d-1,i])
b=[0]*(n-1)
def f(x,y):
    r=1
    for (i,j) in a[x]:
        if r==y:
            r+=1
        b[j]=r
        f(i,r)
        r+=1
f(0,0)
print(max(b))
print(*ans,sep="\n")

### FIXED CODE ###

import sys
sys.setrecursionlimit(10**7)
n=int(input())
s=[[]for i in range(n+1)]
t=[0]*(n-1)
for i in range(n-1):
    a,b=map(int,input().split())
    s[a-1].append([b-1,i])
def f(x,r):
    c=1
    for (i,j) in s[x]:
        if c==r:
            c+=1
        t[j]=c
        f(i,c)
        c+=1
f(0,0)
print(max(t))
for i in t:
    print(i)
n = int(input())
h = list(map(int,input().split()))
count = 0
sum = 0
for i in range(1,n):
  　for s in range(i-1,0):
      if h[i]>h[s]:
         count+=1
    if count==n:
       sum+=1
print(sum)

### FIXED CODE ###

n = int(input())
h = list(map(int,input().split()))
sum = 1
for i in range(1,n):
  if max(h[:i])<=h[i]:
     sum+=1
print(sum)
,X=map(int,input().split())
a=[]
for i in range(0,K):
  a.append(X-i)
for i in range(1,K):
  a.append(X+i)
s=a.sort()
print(s)

### FIXED CODE ###

K,X=map(int,input().split())
for i in range(X-K+1,X+K):
  print(i)
N = int(input())
Ai = list(map(int, input().split()))
for i in Ai:
    print(Ai.count(i))



### FIXED CODE ###

import math
user = int(input())
print((math.pi)*2*user)
abstr = input().split()
ab = int(abstr[0]+abstr[1])

for i in range(400):
    if i**==ab:
        print('Yes')

else:
    print('No')


### FIXED CODE ###

abstr = input().split()
ab = abstr[0]+abstr[1]

for i in range(400):
    if i**2==int(ab):
        print('Yes')
        break

else:
    print('No')
a,b=map(int,input())

print(a*b)

### FIXED CODE ###

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