Harryxun/stf_run huggingface dataset:
class A:

    def solve(self):
        [a, b, c] = sorted([int(x) for x in input().split(" ")])
        if a == 5 and b == 5 and c == 7:
            print("YES")
        else:
            print("NO")

class B:

    def solve(self):
        [n, l] = [int(x) for x in input().split(" ")]

        strings = []
        for r in range(n):
            strings.append(input())

        sorted_strings = sorted(strings)

        print("".join(sorted_strings))

class C:

    def solve(self):
        [n, k] = [int(x) for x in input().split(" ")]
        dislikes = [int(x) for x in input().split(" ")]

        likes = []
        for r in range(10):
            if r not in dislikes:
                likes.append(r)

        import bisect as b

        final_amount = []
        for c in str(n):
            i = b.bisect_left(likes, int(c))
            final_amount.append(str(likes[i]))

        print("".join(final_amount))

C().solve()


### FIXED CODE ###

class A:

    def solve(self):
        [a, b, c] = sorted([int(x) for x in input().split(" ")])
        if a == 5 and b == 5 and c == 7:
            print("YES")
        else:
            print("NO")

class B:

    def solve(self):
        [n, l] = [int(x) for x in input().split(" ")]

        strings = []
        for r in range(n):
            strings.append(input())

        sorted_strings = sorted(strings)

        print("".join(sorted_strings))

class C:

    def fix(self, final_amount, likes):
        i = 0
        import bisect as b
        changed = False
        for i,x in enumerate(reversed(final_amount)):
            real_index = len(final_amount) - i - 1
            ind = b.bisect_right(likes, int(x))
            if ind != len(likes):
                final_amount[real_index] = str(likes[ind])
                changed = True
                break

        if not changed:
            ind = b.bisect_right(likes, 0)
            final_amount = [str(likes[ind])] + final_amount
            i = 1
        else:
            i = len(final_amount) - i - 1

        while i < len(final_amount):
            final_amount[i] = str(likes[0])
            i += 1

        return final_amount

    def solve(self):
        [n, k] = [int(x) for x in input().split(" ")]
        dislikes = [int(x) for x in input().split(" ")]

        likes = []
        for r in range(10):
            if r not in dislikes:
                likes.append(r)

        import bisect as b

        final_amount = []
        sn = str(n)
        for ind in range(len(sn)):
            c = sn[ind]
            i = b.bisect_left(likes, int(c))
            if i == len(likes):
                prev_len = len(final_amount)
                final_amount = self.fix(final_amount, likes)
                final_amount += [str(likes[0]) for r in range(len(sn) - prev_len)]
                break

            if str(c) != str(likes[i]):
                final_amount.append(str(likes[i]))
                final_amount += [str(likes[0]) for r in range(len(sn) - len(final_amount))]
                break

            final_amount.append(str(likes[i]))

        print("".join(final_amount))

C().solve()
#ABC129C 動的計画法

n, m = map(int, input().split())
a = int(input()) for _ in range(m)

dp = [0] * 10000
dp[0] = 1
if 1 not in a:
    dp[1] = 1

for i in range(2, n + 1):
    if  (i - 1) not in a:
        print("/", dp[i])
        dp[i] = dp[i] + dp[i - 1]
        print("●  dp[{0}]={2}  dp[{1}]={3}".format(i-1, i, dp[i - 1],  dp[i]))
    if (i - 2) not in a:
        print("//", dp[i])
        dp[i] = dp[i - 2] + dp[i] 
        print("■  dp[{0}]={2}  dp[{1}]={3}".format(i-2, i, dp[i - 1],  dp[i]))
    
    print("dp[{0}]={1}".format(i, dp[i]))
    
    dp[i] %= 1000000007
    
print(dp[n])

### FIXED CODE ###

n, m = map(int, input().split())
issafe = [True] * (n +1)
for _ in range(m):
    a = int(input())
    issafe[a] = False

dp = [0] * (n + 1)
dp[0] = 1
if issafe[1]:
    dp[1] = 1

for i in range(2, n + 1):
    if  issafe[i - 1]:
        dp[i] = dp[i] + dp[i - 1]
    if issafe[i -  2]:
        dp[i] = dp[i - 2] + dp[i] 
    
    dp[i] %= 1000000007
    
print(dp[n])
s=list(input())
t=list(input())

x=len(s)

ch1=0
ch=0

for i in range(x):
  if s[i]=t[x-1-i]:
    ch+=1

for j in range(x):
  if s[j]=t[j]:
    ch1+=1
    
print('Yes' if ch==x or ch1==x else 'No' )
  


### FIXED CODE ###

s=list(input())
t=list(input())

S=s+s
c=0

for i in range(len(s)):
  ch=0
  for j in range(len(s)):
    if S[i+j]==t[j]:
      ch+=1
  if ch==len(s):
    c+=1

if c>0:
  print('Yes')
  
else:
  print('No')
from math import gcd
a,b,c=map(int,input().split())
d=gcd(a,b)
if c%d==0:
  print("YES")
else:
  print("NO")

### FIXED CODE ###

from fractions import gcd
a,b,c=map(int,input().split())
d=gcd(a,b)
if c%d==0:
  print("YES")
else:
  print("NO")
S=input()

if S.count('R')==0
  print(0)
if S.count('R')==1
  print(1)
if S.count('R')==2 and moji.count('RR')!=1
  print(1)
if S.count('RR')==1
  print(2)
if S.count('RRR')==1
  print(3)
  

### FIXED CODE ###

S=str(input())
 
if S.count('R')==0:
  print(0)
if S.count('R')==1 :
  print(1)
if S.count('R')==2 and not S.count('RR') ==1:
  print(1)
if S.count('RR')==1 and not S.count('RRR')==1:
  print(2)
if S.count('RRR')==1:
  print(3)
a = input.split(' ')
A = a[0]
B = a[1]
A_A = A + A - 1
A_B = A + B
B_B = B + B - 1
list = [A_B, A_A, B_B]
list.sort(reverse=True)
print(list[0])

### FIXED CODE ###

A,B = map(int,input().split())
A_A = A + A - 1
A_B = A + B
B_B = B + B - 1
list = [A_B, A_A, B_B]
list.sort(reverse=True)
print(list[0])
int main() {
  int N;
  int K;
  int a[55];
  cin >> N >> K;
  
  for(int i=0; i<N; ++i) {
    cin >> a[i];
  }
  sort(a,a+N,greater<int>());
  int ans=0;
  for(int i=0; i<=K; ++i) {
    ans += a[i];
  }
  cout << ans << endl;
}

### FIXED CODE ###

N,K = map(int,input().split())
L = list(map(int,input().split()))
L.sort(reverse = True)
print(sum(L[0:K]))
a,b=int(input().split())
z=float(a/b)
print(z)

### FIXED CODE ###

a,b=map(int,input().split())
z=float(a/b)
print(z)
head=[int(n) for n in input.readline().split()]
list_x=[int(n) for n in input.readline().split()]
list_x.append(head[2])
list_y=[int(n) for n in input.readline().split()]
if max(list_x) < min(list_y):
    print("No War")
else:
    print("War")

### FIXED CODE ###

head=[int(n) for n in input().split()]
list_x=[int(n) for n in input().split()]
list_x.append(head[2])
list_y=[int(n) for n in input().split()]
list_y.append(head[3])
if max(list_x) < min(list_y):
    print("No War")
else:
    print("War")
import math

N=int(input())
S=[]
for i in range(N):
    s=input()
    ss=list(s)
    ss.sort()
    S.append(ss)
S.sort()
ans=0
cnt=0
for i in range(N-1):
    if S[i]==S[i+1]:
        cnt+=1
    else:
        ans+=math.factorial(cnt-1)
        cnt=0
print(ans)

### FIXED CODE ###

N=int(input())
S_list=[]
for i in range(N):
    s=input()
    ss=list(s)
    ss.sort()
    S_list.append(ss)
S_list.sort()
ans=0
cnt=0
for i in range(1,N):
    if S_list[i]==S_list[i-1]:
        cnt+=1
        ans+=cnt
    else:
        cnt=0
print(ans)
A, B, K = map(int,input().split())
listAB = []
for i in range(min(A,B)):
    if A%(i+1) == 0 and B % (i+1) == 0:
        listAB.append(i+1)
listAB.sort(reverse = True)
if A == 1 or B == 1:
    print(1)
else:
    print(listAB[K-1])

### FIXED CODE ###

import math

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

if B - A*C < 0:
    print(math.floor(B/A))
else:
    print(C)
N= int(input())
num = N % 10

if num == 3:
  print("bon")
elif num == 0 or num == 1 or num == 6 or num == 8:
  print("pon")
else
 print("hon")

### FIXED CODE ###

N= int(input())
num = N % 10

if num == 3:
  print("bon")
elif num == 0 or num == 1 or num == 6 or num == 8:
  print("pon")
else:
  print("hon")
s = input()

l = len(s)
ans = 0

for i in range(l-3):
    left = i
    right = left + 4
    while (right < l+1):
        now = int(s[left:right])
        if (now % 2019 == 0):
            right += 4
            ans += 1
        else:
            right += 1

print(ans)


### FIXED CODE ###

s, w = map(int, input().split())
if w >= s:
    print("unsafe")
else:
    print("safe")
num = int(input())
actions = []
for i in range(num):
    actions.append(list(map(int, input().split())))

dp = [[0 if j != 0 else actions[i][j] for i in range(3)] for j in range(num)]
for i in range(num) if i != 0:
    dp[i][0] = max(dp[i-1][1], dp[i-1][2]) + actions[i][0]
    dp[i][1] = max(dp[i-1][0], dp[i-1][2]) + actions[i][1]
    dp[i][2] = max(dp[i-1][0], dp[i-1][1]) + actions[i][2]

print(max( dp[num-1][0], dp[num-1][1] ,dp[num-1][2] ))

### FIXED CODE ###

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

dp = [[0 for i in range(3)] for j in range(num)]
for i in range(num):
    if i == 0:
        dp[i][0] = actions[i][0]
        dp[i][1] = actions[i][1]
        dp[i][2] = actions[i][2]
    else:
        dp[i][0] = max(dp[i-1][1] + actions[i][0], dp[i-1][2] + actions[i][0])
        dp[i][1] = max(dp[i-1][0] + actions[i][1], dp[i-1][2] + actions[i][1])
        dp[i][2] = max(dp[i-1][0] + actions[i][2], dp[i-1][1] + actions[i][2])

print(max( dp[num-1][0], dp[num-1][1] ,dp[num-1][2] ))
al = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')
N = int(input())
S = list(input())

for i in range(len(S)):
  x = al.index(S[i])
  c = x+N
  if c <= 25:
      S[i] = al[c]
  else:
      S[i] = al[c-25]
      
print("".join(S))

### FIXED CODE ###

al = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')
N = int(input())
S = list(input())

for i in range(len(S)):
  x = al.index(S[i])
  c = x+N
  if c <= 25:
      S[i] = al[c]
  else:
      S[i] = al[c-26]
      
print("".join(S))
n = int(input())
p = list(map(int, input().split()))
ans = 0
MIN = n + 1

for i in range(n):
    if MIN > p[i]:
        ans += 1
    MIN = min(MIH, p[i])

print(ans)

### FIXED CODE ###

n = int(input())
p = list(map(int, input().split()))
min = float('inf')
ans = 0

for i in p:
    if i <= min:
        min = i; ans += 1

print(ans)
l=[0]*100001
n=int(input())
for i in range(n):
  a=int(input())
  l[a]=abs(l[a]-1)
print(l.count(1))

### FIXED CODE ###

q=[]
n=int(input())
l=[]
for i in range(n):
  l.append(int(input()))
l.sort()
for a in l:
  if len(q)==0:
    q.append(a)
  else:
    b=q.pop()
    if a==b:
      pass
    else:
      q.append(b)
      q.append(a)
print(len(q))
import sys

def search_next(nextbutton : int) -> int:
    nextbutton = a.index(nextbutton) +1
    return nextbutton

n = int(input())
a = [int(input()) for i in range(n)]
nextbutton = 2
count = 1

try :
    nextbutton = search_next(nextbutton)
except:
    print(-1)
    sys.exit()
#print(nextbutton,"first")

while 1:
    if nextbutton == 2:
        print(-1)
        #print(nextbutton,"2")
        
        sys.exit()
    elif nextbutton == 1:
        print(count)
        #print(nextbutton,"1")
        
        sys.exit()
    else:
        nextbutton = search_next(nextbutton)
        #print(nextbutton,"el")
        
        count += 1

### FIXED CODE ###

import sys

def search_next(nextbutton : int) -> int:
    nextbutton = a.index(nextbutton) +1
    return nextbutton

n = int(input())
a = [int(input()) for i in range(n)]
nextbutton = 1
count = 0

#print(nextbutton,"first")

for _ in range(n):
    if nextbutton == 2:
        print(count)
        #print(nextbutton,"1")
        
        sys.exit()
    else:
        nextbutton = a[nextbutton -1]
        #print(nextbutton,"el")
        
        count += 1
print(-1)
from sys import stdin
import math
N = int(stdin.readline().rstrip())
A = [int(x) for x in stdin.readline().rstrip().split()]
ans = A[0]
for k in range(N)[1:]:
    ans = math.gcd(ans, A[k])
print(ans)


### FIXED CODE ###

from sys import stdin
import fractions
N = int(stdin.readline().rstrip())
A = [int(x) for x in stdin.readline().rstrip().split()]
ans = A[0]
for k in range(N)[1:]:
    ans = fractions.gcd(ans, A[k])
print(ans)
import sqrt
a, b = input().split()
if sqrt(int(a+b)) % 1 == 0:
  print("Yes")
else:
  print("No")

### FIXED CODE ###

from math import sqrt
a, b = input().split()
if sqrt(int(a+b)) % 1 == 0:
  print("Yes")
else:
  print("No")
def fcd(a , b):
    
    if a>= b:
        while b != 0:
            a,b = b,a%b
        return a
    
    else:
        while a != 0:
            b,a = a,b%a
        return b
    
    
def lcm(a,b):
    return int(a*b/fcd(a , b))


n = int(input())
t_list = []
ans_list = []
for i in range(n):
    t_list.append(int(input()))
    
    
for i in range(len(t_list)):
    if i == 0:
        ans_list.append(t_list[0])
        continue
    if i == 1:
        ans_list.append(lcm(t_list[0] , t_list[1]))
    
    if i >=2:
        ans_list.append(lcm(ans_list[-1],t_list[i]))
print(ans_list[-1])

### FIXED CODE ###

def fcd(a , b):
    
    if a>= b:
        while b != 0:
            a,b = b,a%b
        return a
    
    else:
        while a != 0:
            b,a = a,b%a
        return b
    
    
def lcm(a,b):
    return a*b//fcd(a , b)


n = int(input())
t_list = []
ans_list = []
for i in range(n):
    t_list.append(int(input()))
    
    
for i in range(len(t_list)):
    if i == 0:
        ans_list.append(t_list[0])
        continue
    if i == 1:
        ans_list.append(lcm(t_list[0] , t_list[1]))
    
    if i >=2:
        ans_list.append(lcm(ans_list[-1],t_list[i]))
print(ans_list[-1])
import sys
readline = sys.stdin.readline()
A,B,C = map(int,readline().split())
print(C,A,B)

### FIXED CODE ###

import sys
#readline = sys.stdin.readline()
A,B,C = map(int,input().split())
print(C,A,B)
import math

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

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

for i in range(1,k+1):
  ans = combinations_count(n-k+1, i)*combinations_count(k-1, i-1)
  ans = ans%(10**9+7)
  print(ans)


### FIXED CODE ###

import math
 
def combinations_count(n, r):
  return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

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

if n == k:
  for i in range(1, k+1):
    if i == 1:
      print(1)
    else:
      print(0)
else:
  for i in range(1,k+1):
    if i <= n-k+1:
      p1 = combinations_count(n-k+1, i)
      p2 = combinations_count(k-1, i-1)
      ans = p1*p2
      ans = ans%(10**9+7)
      print(ans)
    else:
      print(0)
N = int(input())
S=input()
cnt1 = 0
cnt2 = 0
for idx,s in enumerate(S):
    print(idx)
    if s != "." and idx != N-1:
        cnt1 += 1
    if s!="#":
        cnt2+=1
print(min([cnt1,cnt2]))

### FIXED CODE ###

X= [int(i) for i in input().split()]
if (X[0] > X[2] and X[1] < X[2]) or (X[0] < X[2] and X[1] > X[2]) :
    print("Yes")
else:
    print("No")
from collections import defaultdict
N,Q = map(int,input().split())
AB = []
for _ in range(N-1):
    AB.append([int(i) for i in input().split()])
PX = []
for _ in range(Q):
    PX.append([int(i) for i in input().split()])
class Tree:
    def __init__(self,n):
        self.tree = defaultdict(list)
        self.score = [0]*n
    def add_edge(self,n1,n2):
        self.tree[n1].append(n2)
    def calc_score(self,n,s):
        self.score[n-1]+=s
        if self.tree[n] == []:
            pass
        else:
            for n in self.tree[n]:
                self.calc_score(n,s)
tree = Tree(N)
for ab in AB:
    tree.add_edge(ab[0],ab[1])
for px in PX:
    tree.calc_score(px[0],px[1])
print(*tree.score)

### FIXED CODE ###

N,Q = map(int,input().split())
AB = [[] for _ in range(N-1)]
for n in range(N-1):
    AB[n] = list(map(int,input().split()))
PX = [[] for _ in range(Q)]
for q in range(Q):
    PX[q] = list(map(int,input().split()))
graph = [[] for _ in range(N+1)]
for ab in AB:
    graph[ab[0]].append(ab[1])
    graph[ab[1]].append(ab[0])
val = [0] * (N+1)
for px in PX:
    val[px[0]] += px[1]
parent = [0] * (N+1)
from collections import deque
Q  = deque([1])
while Q:
    q = Q.popleft()
    for c in graph[q]:
        if c == parent[q]:
            continue
        parent[c] = q
        Q.append(c)
        val[c] += val[q]
print(*val[1:])
a = int(input())
color = input()

if a < 3200:
  print("red")
  else
  print(color)

### FIXED CODE ###

a = int(input())
color = input()
 
if a < 3200:
  print("red")
else:
  print(color)
import math
a,b,x=map(int,input().split())
ans = 0
if a*a*b/2 >= x:
    x/=a
    x=x*2/b
    ans = math.atan(x/b)
else:
    x/=a*a
    x=(b-x)*2
    ans = math.atan(a/x)
print(90-ans/math.pi*180)

### FIXED CODE ###

import math
a,b,x=map(int,input().split())
ans = 0
if a*a*b==x:
    ans = math.pi/2
elif a*a*b/2 >= x:
    x/=a
    x=x*2/b
    ans = math.atan(x/b)
else:
    x/=a*a
    x=(b-x)*2
    ans = math.atan(a/x)
print(90-ans/math.pi*180)
N,M,K=map(int,input().split())
friend=[list(map(int,input().split())) for i in range(M)]
block=[list(map(int,input().split())) for i in range(K)]
newfriend=[]
for i in range(M):
    newdata=friend[i].copy()
    newfriend.append(newdata)
fchain=[friend[0]]
did=0
for i in range(M):
    newfriend[i].sort()
for i in range(K):
    block[i].sort()
for i in range(1,M):
    did=0
    for j in range(len(fchain)):
        q,w=-1,-1
        for k in range(len(fchain)):
            if friend[i][0] in fchain[k]:
                q=k
            if friend[i][1] in fchain[k]:
                w=k
        if q!=w and q>=0 and w>=0:
            b=fchain.pop(max(q,w))
            fchain[min(q,w)]+=b
            did=1
            break
        elif (friend[i][0] in fchain[j]) and (friend[i][1] not in fchain[j]):
            fchain[j].append(friend[i][1])
            did=1
            break
        elif (friend[i][0] not in fchain[j]) and (friend[i][1] in fchain[j]):
            fchain[j].append(friend[i][0])
            did=1
            break
        elif (friend[i][0]  in fchain[j]) and (friend[i][1] in fchain[j]):
            did=1
            break
    if did==0:
        fchain.append(friend[i])
ans=[]
for i in range(1,N+1):
    count=0
    for j in range(len(fchain)):
        if i in fchain[j]:
            where=j
            fchain[j].sort()
            break
    for j in range(len(fchain[where])):
        need=[i,fchain[where][j]]
        need.sort()
        if i==fchain[where][j]:
            continue
        elif (need not in newfriend) and (need not in block):
            count+=1
    ans.append(count)
print(" ".join(map(str,ans)))
        
    


### FIXED CODE ###

import sys
sys.setrecursionlimit(10**5)
N,M,K = list(map(int,input().split(' ')))

friend_list = [0]*(N+1)
bad_list = [0]*(N+1)
group = {}

parent = [i for i in range(N+1)]
rank = [0]*(N+1)

def union(x,y):
    x = find(x)
    y = find(y)
    if x==y:
        return
    if rank[x]<rank[y]:
        parent[x]=y
    else:
        parent[y]=x
        if rank[x]==rank[y]:
            rank[x]+=1

def find(x):
    if parent[x] == x:
        return x
    else:
        parent[x]= find(parent[x])
        return parent[x]





for i in range(M):
    A,B = list(map(int,input().split(' ')))
    friend_list[A]+=1
    friend_list[B]+=1
    
    union(A,B)

for i in range(1,N+1):
    oya = find(i)
    if oya in group:
        group[oya] = group[oya]+1
    else:
        group[oya]=1

for i in range(K):
    A,B = list(map(int,input().split(' ')))
    if find(A)==find(B):
        bad_list[A]+=1
        bad_list[B]+=1


kouho = [0]*N

for i in range(1,N+1):
    oya = find(i)
    abc = group[oya]-friend_list[i]-bad_list[i]-1
    kouho[i-1] = abc

for k in kouho:
    print(k,end=" ")
print()
n, x, m = map(int,input().split())
ans = x
num = 0
l = [0]*m
lis = [-1]*m
l[0] = x
lis[x] = num
for i in range(1,n):
    x = (x*x)%m
    num += 1
    if lis[x]!=-1:
        a = (n-i)//(i-lis[x])
        b = (n-i)%(i-lis[x])
        ans += a * sum(l[lis[x]:i])
        break
    l[i] = x
    lis[x] = i
    ans += x
for i in range(lis[x],lis[x]+b):
    ans += l[i]
print(ans)

### FIXED CODE ###

n, x, m = map(int,input().split())
ans = x
num = 0
l = [0]*m
lis = [-1]*m
l[0] = x
lis[x] = num
for i in range(1,n):
    x = (x*x)%m
    num += 1
    if lis[x]!=-1:
        a = (n-i)//(i-lis[x])
        b = (n-i)%(i-lis[x])
        ans += a * sum(l[lis[x]:i])
        for j in range(lis[x],lis[x]+b):
            ans += l[j]
        break
    l[i] = x
    lis[x] = i
    ans += x
print(ans)
a=input()
b=input()

if (a*b)%2==0:
  print("Even")
else:
  print("Odd")

### FIXED CODE ###

a,b=map(int,input().split()) #1行で1スペースあけて入力

if (a*b)%2==0:
    print('Even')
else:
    print('Odd')
import sys
input = sys.stdin.readline
n = int(input())
s = ["".join(sorted(input().split()[0])) for _ in range(n)]
cnt = {}
result = 0
for si in s:
    if si in cnt:
        result += cnt[si]
        cnt[si] += 1
    else:
        cnt[si] = 1
print(result

### FIXED CODE ###

import sys
input = sys.stdin.readline
n = int(input())
s = ["".join(sorted(input().split()[0])) for _ in range(n)]
cnt = {}
result = 0
for si in s:
    if si in cnt:
        result += cnt[si]
        cnt[si] += 1
    else:
        cnt[si] = 1
print(result)
N = int(input())
sum = 0
for i in range(N):
    x,u = map(int,input().split())
    if u == 'BTC':
        x = float(x)
        x *= 380000.0
    sum += x
print(sum)

### FIXED CODE ###

N = int(input())
sum = 0.0
for i in range(N):
    x,u = input().split()
    x = float(x)
    if u == 'BTC':
        x *= 380000.0
    sum += x
print(sum)
N, R = map(int, input().split(' '))
if N < 9:
    L =  R+100*(10-N)
    print('{}'format(L))

else:
    print('{}'.format(R))


### FIXED CODE ###

N, R = map(int, input().split(' '))
if N < 10:
    L =  R+100*(10-N)
    print('{}'.format(L))

else:
    print('{}'.format(R))
n = int(input())
a = list(map(int,input().split()))

x = [0]*n
j = 0
for i in range(n):
    k = 1
    while j < n-1:
        if i+1 == a[j]:
            j+=1
            k+=1
        else:
            break
    x[i] = k

ans = [print(_) for _ in x]

### FIXED CODE ###

import math
r = int(input())
print(r*2*math.pi)
print('Yay!' if int(input())>=8 and int(input())>=8 else ':(')

### FIXED CODE ###

a,b = list(map(int, input().split()))
if a<=8 and b<=8: print('Yay!')
else: print(':(')
s = input()
t = input()
# snum = []
# tnum = []
# for c in range(ord('a'), ord('z') + 1):
#     snum.append([i for i, x in enumerate(s) if x == chr(c)])
# for c in range(ord('a'), ord('z') + 1):
#     tnum.append([i for i, x in enumerate(t) if x == chr(c)])
# snum.sort()
# tnum.sort()
# print('Yes' if snum == tnum else 'No')


sn=[0 for i in range(26)]
tn=[0 for i in range(26)]
for i in range(len(s)):
    sn[ord(s[i])]+=1
    tn[ord(t[i])]+=1
print('Yes' if sorted(sn) == sorted(tn) else 'No')



### FIXED CODE ###

s = input()
t = input()
snum = []
tnum = []
for c in range(ord('a'), ord('z') + 1):
    snum.append([i for i, x in enumerate(s) if x == chr(c)])
for c in range(ord('a'), ord('z') + 1):
    tnum.append([i for i, x in enumerate(t) if x == chr(c)])
snum.sort()
tnum.sort()
print('Yes' if snum == tnum else 'No')
S=input()
l = len(S)
#keyencexxxxx
if s[:7]=="keyence":
  print("YES")
#kxxxxxeyence
elif s[:1]=="k" and s[l-6:]=="eyence":
  print("YES")
#kexxxxxyence
elif s[:2]=="ke" and s[l-5:]=="yence":
  print("YES")
#keyxxxxxence
elif s[:3]=="key" and s[l-4:]=="ence":
  print("YES")
#keyexxxxxnce
elif s[:4]=="keye" and s[l-3:]=="nce":
  print("YES")
#keyenxxxxxce
elif s[:5]=="keyen" and s[l-2:]=="ce":
  print("YES")
#keyencxxxxxe
elif s[:6]=="keyenc" and s[l-1:]=="e":
  print("YES")
#xxxxxkeyence
elif s[l-7:]=="keyence":
  print("YES")
else:
  print("NO")


### FIXED CODE ###

S=input()
l = len(S)
#keyencexxxxx
if S[:7]=="keyence":
  print("YES")
#kxxxxxeyence
elif S[:1]=="k" and S[l-6:]=="eyence":
  print("YES")
#kexxxxxyence
elif S[:2]=="ke" and S[l-5:]=="yence":
  print("YES")
#keyxxxxxence
elif S[:3]=="key" and S[l-4:]=="ence":
  print("YES")
#keyexxxxxnce
elif S[:4]=="keye" and S[l-3:]=="nce":
  print("YES")
#keyenxxxxxce
elif S[:5]=="keyen" and S[l-2:]=="ce":
  print("YES")
#keyencxxxxxe
elif S[:6]=="keyenc" and S[l-1:]=="e":
  print("YES")
#xxxxxkeyence
elif S[l-7:]=="keyence":
  print("YES")
else:
  print("NO")
n=input()
if int(n[0])>int(n[1]):
  out=int(n[0])
elif int(n[0])==int(n[1]):
  if int(n[1])==int(n[2]):
    out=int(n[0])
  else:
    out=int(n[0]+1)
else:
    out=int(n[0]+1)

print(str(out)*3)

### FIXED CODE ###

n=input()
if int(n[0])>int(n[1]):
  out=int(n[0])
elif int(n[0])==int(n[1]):
  if int(n[1])>=int(n[2]):
    out=int(n[0])
  else:
    out=int(n[0])+1
else:
    out=int(n[0])+1
print(str(out)*3)