Harryxun/stf_run huggingface dataset:
S = input()
T = input()

if S.length == 0 or S.length >= 11:
    print("No" )
else:
    for i in range(S.length):
        if S[i] !=  T[i]:
            return print("No")
        
    if T.length == S.length + 1:
        print("Yes" )
  


### FIXED CODE ###

S = input()
T = input()

print("Yes" if S == T[:-1] else "No" )
def myfunc(h, w, c):
    if 0<=h and h<H+2 and 0<=w and w<W+2 and T[h][w] != '#':
        if T[h][w] == '.' or T[h][w] > c:
            T[h][w] = c
            for i in [(0,1), (0,-1), (1,0), (-1,0)]:
                myfunc(h+i[0], w+i[1], c)
            for k in range(-2, 3):
                for l in range(-2, 3):
                    myfunc(h+k, w+l, T[h][w]+1)

H, W= map(int, input().split())
CH, CW= map(int, input().split())
DH, DW= map(int, input().split())
S = ['#'+input()+'#' for _ in range(H)]
S.insert(0,'#'*(W*2))
S.append('#'*(W*2))
T = [[0] * (W+2) for _ in range(H+2)]
for i in range(H+2):
    for j in range(W+2):
        T[i][j] = S[i][j]
myfunc(CH, CW, 0)
if T[DH][DW] == '#' or T[DH][DW] == '.':
    print(-1)
else:
    print(T[DH][DW])


### FIXED CODE ###

from collections import deque
H, W= map(int, input().split())
CH, CW= map(int, input().split())
DH, DW= map(int, input().split())
S = [list(map(str, input())) for _ in range(H)]
q = deque([(CH-1, CW-1, 0)])
while q:
    h, w, c = q.popleft()
    if S[h][w] == '.':
        S[h][w] = c
        for i in range(-2, 3):
            for j in range(-2, 3):
                if 0<=h+i<H and 0<=w+j<W and S[h+i][w+j] == '.':
                    if abs(i)+abs(j) == 1:
                        q.appendleft((h+i, w+j, c))
                    elif abs(i)+abs(j) >= 2:
                        q.append((h+i, w+j, c+1))
if S[DH-1][DW-1] == '.':
    print(-1)
else:
    print(S[DH-1][DW-1])
text = input()
count = int(input())

for c in range(count):
    args = input().split()
    (a, b) = [int(x) for x in args[1:3]]

    if args[0] == 'print':
        print(text[a:b + 1])
    elif args[0] == 'reverse':
        text = text[0:a] + text[a:b + 1][::-1] + text[b + 1:]
    elif args[0] == 'replace':
        text = text[0:a] + args[3] + text[b + 1]

### FIXED CODE ###

text = input()
count = int(input())

for c in range(count):
    args = input().split()
    (a, b) = [int(x) for x in args[1:3]]

    if args[0] == 'print':
        print(text[a:b + 1])
    elif args[0] == 'reverse':
        text = text[0:a] + text[a:b + 1][::-1] + text[b + 1:]
    elif args[0] == 'replace':
        text = text[0:a] + args[3] + text[b + 1:]
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

n,m = map(int, input().split())
uf = UnionFind(n)
for i in range(m):
  a,b = map(int, input().split())
  uf.union(a, b)

ans = 0
for i in list(uf.all_group_members().values()):
  ans = max(len(i),ans)
  
print(ans)

### FIXED CODE ###

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

n,m = map(int, input().split())
uf = UnionFind(n)
for i in range(m):
  a,b = map(int, input().split())
  uf.union(a-1, b-1)

ans = 0
for i in range(n):
  ans = max(uf.size(i),ans)
  
print(ans)
N, K =  list(map(int, input().split()))
H = list(map(int, input().split()))

for i in range(K):
    m = max(H)
    H.remove(m)
if len(H) == 0:
    ret = 0
else:
    ret = sum(H)
print(ret)

### FIXED CODE ###

N, K =  list(map(int, input().split()))
H = list(map(int, input().split()))
H = list(reversed(sorted(H)))
print(sum(H[K:]))
m=int(input())
n=int(input())
print((m-1)*(n-1))

### FIXED CODE ###

m,n=map(int,input().split())
print((m-1)*(n-1))
a=sort(list(int,input(),split())
b=str(a[2]+a[1])
print(int(b)+a[0])

### FIXED CODE ###

a=list(map(int,input().split()))
a.sort()
print(a[2]*10+a[1]+a[0])
N, M = map(int, input().split())
A = []
for i in range(M):
  A += list(map(int, input().split()))
B = [0 for in range(N)]
for a in A:
  B[a - 1] += 1
for b in B:
  print(b)

### FIXED CODE ###

N, M = map(int, input().split())
A = []
for i in range(M):
  A += list(map(int, input().split()))
B = [0 for i in range(N)]
for a in A:
  B[a - 1] += 1
for b in B:
  print(b)
while True:
	try:
		a,b = map(int, raw_input().split())
		print int(len(str(a+b)))
	except EOFerror:
		break

### FIXED CODE ###

while True:
	try:
		a,b = map(int, raw_input().split())
		print len(str(a+b))
	except EOFError:
		break
def lcm(a, b):
    ax = a
    bx = b
    c = 0
    if a<b:
        ax, bx = (bx, ax)
    while True:
        if ax%bx == 0:
            gcd = bx
            break
        else:
            c = bx
            bx = ax%bx
            ax = c
    return a*b // gcd

n = int(input())
lst = []
lst2 = []
for i in range(n):
    a = int(input())
    lst.append(a)
    
while True:
    lst2.append(lcm(lst[0], lst[1]))
    lst.pop(0)
    lst.pop(0)
    lst2.extend(lst)
    if len(lst2)==1:
        print(lst2[0])
        break
    lst.clear()
        
    lst.append(lcm(lst2[0], lst2[1]))
    lst2.pop(0)
    lst2.pop(0)
    lst.extend(lst2)
    if len(lst)==1:
        print(lst[0])
        break
    lst2.clear()

### FIXED CODE ###

def lcm(a, b):
    ax = a
    bx = b
    if a<b:
        ax, bx = (bx, ax)
    while True:
        if ax%bx == 0:
            gcd = bx
            break
        else:
            c = bx
            bx = ax%bx
            ax = c
    return a*b // gcd

n = int(input())
lst = []
lst2 = []
for i in range(n):
    a = int(input())
    lst.append(a)

while True:    
    if n==1:
        print(lst[0])
        break
    lst2.append(lcm(lst[0], lst[1]))
    lst.pop(0)
    lst.pop(0)
    lst2.extend(lst)
    if len(lst2)==1:
        print(lst2[0])
        break
    lst.clear()
        
    lst.append(lcm(lst2[0], lst2[1]))
    lst2.pop(0)
    lst2.pop(0)
    lst.extend(lst2)
    if len(lst)==1:
        print(lst[0])
        break
    lst2.clear()
# コンテスト名の要求
S =　input()

# 入力されたコンテストではないものを出力
if S == "ABC":
  print("ARC")
else:
  print("ABC")

### FIXED CODE ###

# コンテスト名の要求
S = input()

# 入力されたコンテストではないものを出力
if S == "ABC":
    print("ARC")
elif S == "ARC":
    print("ABC")
else:
    print("入力内容が正しくありません。")
inp=list(map(int,input().split()))
n=inp[0]
k=inp[1]
q=inp[2]
if q<k:
  for i in range(n):
    print ('Yes')
else:
  arr=[k-q]*(n)
  z=[]
  for i in range(n):
    x=int(input())
    arr[x-1]+=1
for i in range(len(arr)):
  if arr[i]>0:
    print ('Yes')
  else:
    print ('No')

### FIXED CODE ###

inp=list(map(int,input().split()))
n=inp[0]
k=inp[1]
q=inp[2]
arr=[k-q]*n
for i in range(q):
        x=int(input())
        arr[x-1]+=1
if q<k:
    for i in range(n):
        print ('Yes')
else:
    z=[]
    for i in range(len(arr)):
        if arr[i]>0:
            print ('Yes')
        else:
            print ('No')
N = input()

if N[0] == N[1] and N[1]== N[2]:
    print ('Yes')
elif N[1] == N[2] and N[2]== N[3]:
    print ('Yes')
elif N[2] == N[3] and N[3]== N[4]:
    print ('Yes')
elif N[0] == N[1] and N[1]== N[2] and N[2]== N[3]:
    print ('Yes')
else:
    print ('No')


### FIXED CODE ###

N = input()
if (N[0] == N[1] == N[2]) or (N[1] == N[2] == N[3]):
    print("Yes")
else:
    print("No")
hp_list = input().split(" ")
h = hp_list[0]
a = hp_list[1]
x = h / a
y = h // a
if (x == y):
  count = x
else:
  count = y + 1
 
print(count)


### FIXED CODE ###

hp_list = input().split(" ")
h = int(hp_list[0])
a = int(hp_list[1])
x = h / a
y = h // a
if (x == y):
  count = x
else:
  count = y + 1

count = int(count)
print(count)
# A
N = int(input())
K = int(input())

print(N-K+1)

### FIXED CODE ###

N, K = [int(x) for x in input().split()]
print(N-K+1)
ans=0
N=int(input()):
  for i in range(N):
    if len(str(i))%2==1:
      ans+=1
print(ans)

### FIXED CODE ###

ans=0
N=int(input())
for i in range(1,N+1):
    if len(str(i))%2==1:
      ans+=1
print(ans)
while True :
    (x,y) = int(i) for i in input().split()
    if x = 0 and y = 0 :
        break
    elif x <= y:
        print(x,y)
    else :
        peint(y,x)

### FIXED CODE ###

while True:
    (x, y) = [int(i) for i in input().split()]
    
    if x == y == 0 :
        break

    if x <= y :
        print(x, y)
    else :
        print(y, x)
import numpy as np

N = int(input())
arr = np.arange(1, 10)
arr2 = arr[:, np.newaxis] * arr

if N in arr2:
    print('Yes')
else:
    print('No')


### FIXED CODE ###

import numpy as np

N = int(input())
arr = np.arange(1, 10)
arr2 = arr[:, np.newaxis] * arr

if N in arr2:
    print('Yes')
else:
    print('No')
heightOfMountains = []
for i in range(10):
	heightOfMountains.append(int(input()))
heightOfMountains.sort()
for i in range(1, 4):
	print(heightOfMountains[-j])

### FIXED CODE ###

heightOfMountains = []
for i in range(1, 11):
	heightOfMountains.append(int(input()))
heightOfMountains.sort()
for i in range(1, 4):
	print(heightOfMountains[-i])
import math
from functools import reduce


def lcm_base(x, y):
    return (x * y) // math.gcd(x, y)

def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

MOD = 1e9+7
N = input()
i = 0
arrs = list(map(int, input().split()))
lcms = lcm_list(arrs)
result = 0
for arr in arrs:
    result = (result+lcms/arr) % MOD

print(int(result))

### FIXED CODE ###


from fractions import gcd
MOD = 10**9+7
N = input()
i = 0
arrs = list(map(int, input().split()))
result = 0
lcms = 1
for number in arrs:
    lcms = (((number * lcms)) //(gcd(number, lcms)))
for arr in arrs:
    result += (lcms//arr)
result = result%MOD
ans = str(result).replace('.0','')
print(ans)
a, b = map(int, input().split())]
if a & 1 and b & 1:
    print("Yes")
else:
    print("No")


### FIXED CODE ###

a, b = map(int, input().split())
if a & 1 and b & 1:
    print("Yes")
else:
    print("No")
a = int(input())
s = int(input())

if a > 3200:
  print(s)
else:
  print("red")

### FIXED CODE ###

a = int(input())
s = input()

if a >= 3200:
  print(s)
else:
  print("red")
N = int(input())
zeros = [0 for i in range(10000)]
for x in range(1,100):
    for y in range(1,100):
        for z in range(1,100):
            n = x**2 + y**2 + z**2 + x*y + y*z + z*x
            if n < 10000:
                zeros[n]+=1

for i in range(N):
    print(zeros[i+1])

### FIXED CODE ###

N = int(input())
zeros = [0 for i in range(10050)]
for x in range(1,105):
    for y in range(1,105):
        for z in range(1,105):
            n = x**2 + y**2 + z**2 + x*y + y*z + z*x
            if n < 10050:
                zeros[n]+=1

for i in range(N):
    print(zeros[i+1])
n=int(input())
a=list(map(int,input().split()))
count=1
if 0 in a:
  print(0)
  exit(0)
for i in a:
    count=count*i
	if count>10**18:
    	print(-1)
        exit(0)
else:
    print(count)


### FIXED CODE ###

n = int(input())
lis = list(map(int,input().split()))
ans = 1
if 0 in lis:
  print(0)
  exit()
for num in lis:
  ans *= num
  if ans > 10 ** 18:
    print(-1)
    exit()
print(ans)
x = input()
print(x*x*x)


### FIXED CODE ###

x = int(input())
x = x*x*x
print(x)
inputs = input().split("\n")
N = int(inputs[0])
V = list(map(int, inputs[1]))
C = list(map(int, inputs[2]))
Z = 0
for v, c in zip(V, C):
    if v-c>0: z += v-c
print(Z)

### FIXED CODE ###

N = int(input())
V = list(map(int, input().split(" ")))
C = list(map(int, input().split(" ")))
Z = 0
for v, c in zip(V, C):
    if v-c>0: Z += v-c
print(Z)
s = input()
t - input()

ans = len(s)

for s_start in range(len(s)):
  if i + len(t) - 1 >= len(s):break;
    dif=0
    for j in range(len(t)):
      if s[i+j] != t[j]:
        dif += 1
    ans = min(ans, dif)
print(ans)

### FIXED CODE ###

s = input()
t = input()

ans = len(s)

for i in range(len(s)):
  if i + len(t) - 1 >= len(s):break;
  dif=0
  for j in range(len(t)):
    if s[i+j] != t[j]:
      dif += 1
  ans = min(ans, dif)
print(ans)
import math
from functools import reduce


N = int(input())

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

ans = 0
    
def lcm_base(x, y):
    return (x * y) // math.gcd(x, y)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

for i in range(len(a)):
    ans += (lcm_list(a) - 1) % a[i]
    
print(ans)

### FIXED CODE ###

N = int(input())
a = list(map(int, input().split()))
print(sum(a) - N)
l=[]
s = "1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51"
s = s.replace(' ','')
l = s.split(',')
k = input()
print(l[int(k)])

### FIXED CODE ###

l=[]
s = "1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51"
s = s.replace(' ','')
l = s.split(',')
k = input()
print(l[int(k)-1])
n, m = map(int, input().split())
x = list(map(int, input().split()))

# print(n, m, x)

# #%%
# n, m =2, 5
# x = [10, 12, 1, 2, 14]


#%%
x.sort()

#%%




#%%

diff_list = []
for i in range(m-1):
    diff = x[i+1] - x[i]
    diff_list.append(diff)


#%%
diff_list.sort()


#%%
if n-1>0:
    print(sum(diff_list[:-(n-1))])
else:
    print(0)    

#%%


#%%


### FIXED CODE ###

n, m = map(int, input().split())
x = list(map(int, input().split()))

# print(n, m, x)

# #%%
# n, m =2, 5
# x = [10, 12, 1, 2, 14]


#%%
x.sort()

#%%




#%%

diff_list = []
for i in range(m-1):
    diff = x[i+1] - x[i]
    diff_list.append(diff)


#%%
diff_list.sort()


#%%
if n-1>0:
    print(sum(diff_list[:-(n-1)]))
else:
    print(sum(diff_list))    

#%%


#%%
def main():
    N, Ma, Mb = map(int, input().split())
    yakuhin = []
    sa = 0
    sb = 0
    for i in range(N):
        yakuhin.append(list(map(int, input().split())))
        sa += yakuhin[i][0]
        sb += yakuhin[i][1]
    
    INF = 10**15
    DP = [[[INF for _ in range(sb+1)] for _ in range(sa+1)] for _ in range(N+1)]
    
    for i in range(N):
        DP[i][0][0] = 0
    
    for i in range(N):
        for j in range(sa+1):
            for k in range(sb+1):
                if(j >= yakuhin[i][0] and k >= yakuhin[i][1]):
                    DP[i+1][j][k] = min(DP[i][j][k], DP[i][j-yakuhin[i][0]][k-yakuhin[i][1]]+yakuhin[i][2])
                else:
                    DP[i+1][j][k] = min(DP[i+1][j][k], DP[i][j][k])
        
    ans = INF
    for i in range(1, N):
        for j in range(1, sa+1):
            for k in range(1, sb+1):
                if(j*Mb == k*Ma):
                    ans = min(ans, DP[i][j][k])    
        
    print(ans if ans != INF else -1)
    
main()

### FIXED CODE ###

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

D = []
for i in range(C):
    D.append(list(map(int, input().split())))

cc = [[0]*C for i in range(3)]
for i in range(N):
    color = list(map(int, input().split()))
    for j in range(len(color)):
        cc[(i+j)%3][color[j]-1] += 1
    
iwakan = [[[0, 0] for _ in range(C)] for _ in range(3)]

for i in range(3):
    for j in range(C):
        tmp = 0
        for k in range(len(cc[i])):
            tmp += cc[i][k]*D[k][j]
        iwakan[i][j][0] = tmp
        iwakan[i][j][1] = j

ans = 10**15
for i in range(len(iwakan)):
    iwakan[i] = sorted(iwakan[i], key=lambda x:x[0])
    
for i in range(3):
    for j in range(3):
        if(iwakan[0][i][1] == iwakan[1][j][1]):
            continue
        for k in range(3):
            if(iwakan[0][i][1] == iwakan[2][k][1]):
                continue
            if(iwakan[1][j][1] == iwakan[2][k][1]):
                continue
            ans = min(ans, iwakan[0][i][0]+iwakan[1][j][0]+iwakan[2][k][0])
            
print(ans)
N = int(input())
S = math.ceil(N / 1.08)
if S * 1.08 != N:
  print(":(")
else:
  print(S)


### FIXED CODE ###

import math
N = int(input())
S = math.ceil(N / 1.08)
if S * 1.08 <= N - 1 or S * 1.08 >= N + 1:
  print(":(")
else:
  print(S)
a=int(input())
ans = 0
for i in range(a+1)
if a%3 != 0 and a%5 !=0:
  ans += i
print(ans)
  
  


### FIXED CODE ###

n=int(input())
ans = 0
for i in range(n+1):
	if i%3 != 0 and i%5 !=0:
  		ans += i
print(ans)
a, b = map(int, input().split())
if a>b:
    print(a+(a-1))
elif a=b:
    print(a*2)
elif a<b:
    print(b+(b-1))

### FIXED CODE ###

a, b = map(int, input().split())
if a>b:
    print(a+(a-1))
elif a==b:
    print(a*2)
elif a<b:
    print(b+(b-1))
import sys
input = sys.stdin.readline

N, K, S = (int(i) for i in input().split())  
#a = [int(i) for i in input().split()] 
#e = [[int(i) for i in input().split()] for i in range(n)] 

seq = []

for i in range(K):
    seq.append(S)

for j in range(i+1, N):
    seq.append(2*S)

print(" ".join(map(str, seq)))


### FIXED CODE ###

import sys
input = sys.stdin.readline

N, K, S = (int(i) for i in input().split())  
#a = [int(i) for i in input().split()] 
#e = [[int(i) for i in input().split()] for i in range(n)] 

seq = []
i = 0
for i in range(K):
    seq.append(S)

for j in range(0, N-K):
    if 2*S > 10**8:
        seq.append(1)
    else:
        seq.append(2*S)

print(" ".join(map(str, seq)))
N=int(input())
A=[]
A.append(int(input()))
a=set(A)
print(len(a))

### FIXED CODE ###

N=int(input())
A=[]
for i in range(N):
  A.append(input())
a=set(A)
print(len(a))
h,w=map(int,input().split())
print("#"*(w+2))
for i in range(h):
    t = input()
    print("#"+w+"#")
print("#"*(w+2))

### FIXED CODE ###

h,w=map(int,input().split())
print("#"*(w+2))
for i in range(h):
    t = input()
    print("#"+t+"#")
print("#"*(w+2))
a,b,c = input().split()
print(["Yes","No"][a!=c])

### FIXED CODE ###

a = input()
if a[0] == a[2]:
  print("Yes")
else:
  print("No")
S=input()
T=input()

cnt=0
ans=0

b=[0]*len(S)
a=[0]*len(S)
for i in range(len(S)):
    cnt = 0
    for j in range(len(T)):
        cnt = 0
        #print(S[i],T[j])
        if S[i]==T[j]:
            cnt+=1
            if j != len(T):
                for k in range(j+1,len(T)-j-2):
                    if S[i+k]==T[j+k]:
                        cnt+=1
                    else:
                        b[i]=cnt
                        break
            b[i]=cnt
            a[i]=j

for i in range(len(a)):
    if a[i]==a.index(a[i]):
        c = a.index(a[i])
        ans = b[c]
        break
        
print(len(T)-ans)

### FIXED CODE ###

S=input()
T=input()
cnt=0
ans=len(T)
 
for i in range(len(S)-len(T)+1):
    cnt=0
    for j in range(len(T)):
        if S[i+j]!=T[j]:
            cnt+=1
    ans=min(ans,cnt)
        
print(ans)
l = list(map(int, input().split()))
sorted_list = l.sorted()
print('{} {} {}'.format(l[0], l[1], l[2])



### FIXED CODE ###

l = list(map(int, input().split()))
sorted_list = sorted(l)
print('{} {} {}'.format(sorted_list[0], sorted_list[1], sorted_list[2]))
N = int(input())
s = [str(input()) for i in range(N)]
ans = 0
a = 0
b = 0
ab = 0
for i in range(N):
    ans += s[i].count('AB')
    if s[i][0] == 'B' and not s[i][-1] == 'A':
        b += 1
    if s[i][-1] == 'A' and not s[i][0] == 'B':
        a += 1
    if s[i][0] == 'B' and s[i][-1] == 'A':
        ab += 1
ans += min(a,b)
ans += ab
print(ans)

### FIXED CODE ###

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

print(N-K+1)
def resolve():
    import sys
    from collections import Counter
    n = int(input())
    s = [sys.stdin.readline().rstrip() for i in range(n)]
    d = Counter(s).most_common()
    e = d[0][1]
    ans = []
    for i in range(len(d)):
        if d[i][1] != e:
            break
        else:
            ans.append(d[i][0])
    for j in sorted(ans):
        print(j)
resolve()

### FIXED CODE ###

def resolve():
    a = set(map(int, input().split()))
    if len(a)==2:
        print("Yes")
    else:
        print("No")
resolve()
n,m=map(int,input().split())
a=[int(i) for i in input().split()]

for i in range(m):
 a.sort()
 print(a)
 b,c=map(int, input().split())
 for i in range(b):
  if a[i] < c:
   a[i] = c
  else:
   break
print(sum(a))


### FIXED CODE ###

n,m=map(int,input().split())
l=[[int(x),1] for x in input().split()]
for i in range(m):
  b,c=map(int,input().split())
  l.append([c,b])

s = sorted(l, key=lambda x:x[0], reverse=True)

c=n
t=0
i=0
while c>0:
  n = s[i][1] if c>=s[i][1] else c
  t += s[i][0] * n
  c -= n
  i += 1

print(t)
a = input()

if a.isupper() == True:
  print('A')

elif a.supper() == False:
  print('a')

### FIXED CODE ###

a = input ()

if a.isupper():
    print('A')
else:
    print('a')
l = list(map(int, input().split()))
n,a,b=l[0],l[1],l[2]
count=0
while True:
  for i in range(a):
    if n == 0:
      break
    count += 1
    n -= 1	
  for i in range(b):
    if n == 0:
      break
    n -= 1
  if n == 0:
    break
print(count)		

### FIXED CODE ###

s = input()
if 'A' in s and 'B' in s:
  print('Yes')
else:
  print('No')
X = int(input())

b = 0
while 1:
    a = (X + b ** 5) ** (1/5)
    if a.is_integer() == True:
        break
    b = -b
    a = (X + (b) ** 5) ** (1/5)
    if a.is_integer() == True:
        break
    b = -b
    b += 1
print(int(a), b)

### FIXED CODE ###

import sys

X = int(input())
for i in range(-118, 120):
    for j in range(-119, 119):
        if i ** 5 - j ** 5 == X:
            print(i, j)
            sys.exit(0)
date = input()
tdate=()

for s in date:
  ldate.insert(s)

#syr = none
#for i in range(4):
#  syr = syr + ldate(i)
#yer = int(syr)

if ldate(5) != 0:
  mon = int(ldate(5) + ldate(6))
else:
  mon = int(ldate(6))

#if ldate(8) != 0:
#  mon = int(ldate(8) + ldate(9))
#else:
#  mon = int(ldate(9))
  
if mon <= 4:
  print("Heisei")
else:
  print("TBD")

### FIXED CODE ###

date = input()
tdate=[]
 
for s in date:
  tdate.append(s)
  
if tdate[5] != "0":
  mon = int(tdate[5] + tdate[6])
else:
  mon = int(tdate[6])


if mon <= 4:
  print("Heisei")
else:
  print("TBD")
inport numpy
N=int(input())
A=list(map(int,input().split()))
s=numpy.argsort(A)
print(' '.join(s))

### FIXED CODE ###

import numpy as np
N=int(input())
A=list(map(int,input().split()))
s=list(np.argsort(A))
print(' '.join(repr(e+1) for e in s))