Harryxun/stf_run huggingface dataset:
T = list(input())
for i in range(1, len(T)):
  if T[i] == "?" and T[i-1] == "P":
    T[i] = "D"
  elif T[i] == "?" and (T[i+1] == "D" or T[i+1] == "?"):
    T[i] = "P"
  elif T[i] == "?":
    T[i] = "D"
print("".join(T))

### FIXED CODE ###

T = list(input())
if len(T) == 1:
  if T[0] == "?":
    print("D")
  else:
    print("".join(T))
else:
  for i in range(len(T)):
    if i > 0 and T[i] == "?" and T[i-1] == "P":
      T[i] = "D"
    elif i < len(T) -1 and T[i] == "?" and (T[i+1] == "D" or T[i+1] == "?"):
      T[i] = "P"
    elif T[i] == "?":
      T[i] = "D"
  print("".join(T))
n, k = map(int, input().split())
H = list(map(int, input().split()))
cnt = 0
for h in H:
    if h >= k:
        cn
        t += 1
print(cnt)

### FIXED CODE ###

n, k = map(int, input().split())
H = list(map(int, input().split()))
cnt = 0
for h in H:
    if h >= k:
        cnt += 1
print(cnt)
AB = list(map(int,input().split()))
m2 = 2*max(AB)-1
two = sum(AB)
if m2>=two:
    print(max2)
else:
    print(two)

### FIXED CODE ###

AB = list(map(int,input().split()))
m2 = 2*max(AB)-1
two = sum(AB)
if m2>=two:
    print(m2)
else:
    print(two)
N = int(input())
A = list(map(int,input().split()))
B = sorted(A)
print(B[N/2]-B[N/2-1])

### FIXED CODE ###

N = int(input())
A = list(map(int,input().split()))
B = sorted(A)
print(B[N//2]-B[N//2-1])
S = input()
N = len(S)
K = int(input())

S1 = {}
for i, s in enumerate(S):
    if not s in S1.keys():
        S1[s] = [i]
    else:
        S1[s].append(i)
alp = sorted(list(S1.keys()))

c = 0
for a in alp:
    aset = set()
    inds = S1[a]
    for d in inds:
        for i in range(N-d+1):
            aset.add(S[d:d+i])
    if len(aset)-1 >= K-c:
        break
    c += len(aset)-1


for _ in range(5):
    for i, a in enumerate(aset):
        if i == 0:
            min = a
            continue
        if a < min:
            min = a
    aset.discard(min)
    if min == '':
        continue
    c += 1
    if c >= K:
        ans = min
        break

print(ans)


### FIXED CODE ###

def main():
    S = input()
    N = len(S)
    K = int(input())

    S1 = {}
    for i, s in enumerate(S):
        if not s in S1.keys():
            S1[s] = [i]
        else:
            S1[s].append(i)
    alp = sorted(list(S1.keys()))

    c = 0
    for a in alp:
        aset = set()
        inds = S1[a]
        for d in inds:
            up = min(N-d+1, K+1)
            for i in range(up):
                aset.add(S[d:d+i])
        L = len(aset)-1
        if L >= K-c:
            break
        c += L

    for _ in range(10):
        M = '何だこれはもうやめてくれよ'
        for a in aset:
            if a < M:
                M = a
        aset.discard(M)
        if M == '':
            continue
        c += 1
        if c >= K:
            ans = M
            break

    print(ans)



if __name__=='__main__':
    main()
a,b,x=map(int,input())
if x>=a+b:print("YES")
else:print("NO")

### FIXED CODE ###

a,b,x=map(int,input().split())
if a<=x<=a+b:print("YES")
else:print("NO")
n,m = map(int, input().split())

listA = [[list(map(int, input().split()))] for j in range(n)]

ans = 0


for a in range(m):
    for i in range(n):
        listA[i].pop(0)
        if a in listA[i]:
            ans += 1


print(ans)

### FIXED CODE ###

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

listA = [list(map(int, input().split())) for j in range(n)]

ans = 0


for a in range(1, m+1):
    ok = True
    for i in range(n):
        if a not in listA[i][1:]:
            ok = False
    if ok:
        ans += 1



print(ans)
n = int(input())

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

import math
from functools import reduce


def gcd(numbers):
    return reduce(math.gcd, numbers)


g = gcd(a)
a = [a[i]//g for i in range(n)]


m = 1
for i in range(n):
    b = a[:]
    del b[i]
    gg = gcd(b)
    m = max(m, gg)


print(g * m)

### FIXED CODE ###


n = int(input())

a = list(map(int, input().split()))
a.sort(reverse=True)


from functools import lru_cache
import sys
if n == 2:
    print(max(a))
    sys.exit()


@lru_cache(maxsize=100000)
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x


def gcd_list(li):
    if len(li) == 1:
        return li[0]
    g = gcd(li[0], li[1])
    for i in range(2, len(li)):
        g = gcd(g, li[i])
    return g


def gcd_list_2(li):
    g = gcd(li[0], li[1])
    if g == 1:
        return max(gcd_list([li[0]] + li[2:]), gcd_list(li[1:]))
    for i in range(2, n):
        if gcd(g, li[i]) == 1:
            if i == n - 1:
                return gcd_list(li[:i])
            gg = gcd_list(li[i+1:])
            bb = [gcd(li[x], gg) for x in range(i+1)]
            bb.sort()
            return bb[1]
        else:
            g = gcd(g, li[i])
    return g


def max_gcd(a):
    g = gcd_list(a)
    a = [a[i]//g for i in range(n)]
    m = gcd_list_2(a)
    print(g * m)


max_gcd(a)
print(6.28 * int(input())

### FIXED CODE ###

print(6.28 * int(input()))
n = int(input())
a = [int(input()) for i in range(n)]
import collections
b = collections.Counter(a)
set_a = set(a)
cnt = 0
for i in range(len(set_a)):
    if b[set_a[i]]%2 == 1:
        cnt += 1
print(cnt)

### FIXED CODE ###

n = int(input())
a = [int(input()) for i in range(n)]
import collections
b = collections.Counter(a)
set_a = list(set(a))
cnt = 0
for i in range(len(set_a)):
    if b[set_a[i]]%2 == 1:
        cnt += 1
print(cnt)
n = int(input())
a = map(int,input().split())
for i in range(n)
    r = 1 / a[i]
print(1/r)

### FIXED CODE ###

d = input()
a = input().split()
r = 0
for i in a:
    r += 1 / int(i)
print(1 / r)
140 proA
N = int(input())
ans = 0
for i in range(N):
	for j in range(N):
		for t in range(N):
			ans+=1
print(ans)#N^3が答え

### FIXED CODE ###


N = int(input())
ans = 0
for i in range(N):
	for j in range(N):
		for t in range(N):
			ans+=1
print(ans)#N^3が答え
def solve():
    x = int(input())
    l = [i**j for i in range(1,x+1) for j in range(2,x+1) if i**j<=x]
    return max(l)
        
if __name__ == '__main__':
    print(solve())

### FIXED CODE ###

def solve():
    x = int(input())
    if x < 4:
        return 1
    elif x < 8:
        return 4
    elif x < 9:
        return 8
    l = [i**j for i in range(1,x+1) for j in range(2,int(x**0.5)) if i**j<=x]
    return max(l)
        
if __name__ == '__main__':
    print(solve())
N = int(input(()))
L = list(map(int,input().split()))
count = 0

l = []
for j in range(N-1):
    for i in range(j+1,N):
        for k in range(i+1,N):
            if(L[i]+L[j]>L[k])and(L[i]+L[k]>L[j])and(L[i]<L[j]+L[k]):
                l.append([i,j,k])
                if [i,j,k] in l:
                    continue
                else:
                    count += 1
print(count)

### FIXED CODE ###

A,B = map(int,input().split())
if A < 2*B:
  print(0)
else:
  print(A-2*B)
a, b, c = map(int, input())
if a<c and c<b:
  print("Yes")
else:
  print("No")


### FIXED CODE ###

a, b, c = map(int, input().split())
if a<c<b or b<c<a:
  print("Yes")
else:
  print("No")
N = int(input())
T = [[0,0,0]]+[map(int, input().split()) for _ in range(N)]
flag = 'Yes'
i = 0
while flag=='Yes' and i<len(T)-1:
    dis = abs(T[i][2]-T[i][2])+abs(T[i][1]-T[i][1])
    _t = T[i][0]-T[i][0]
    if dis > _t or _t%2 != dis%2:
        flag = 'No'
    i += 1        
print(flag)

### FIXED CODE ###

N = int(input())
T = [[0,0,0]]+[ [int(x) for x in input().split()] for _ in range(N)]

flag = 'Yes'
i = 0
while flag=='Yes' and i<len(T)-1:
    t1,x1,y1 = T[i] 
    t2,x2,y2 = T[i+1]
    dis = abs(x2-x1)+abs(y2-y1)
    _t = t2-t1
    if dis > _t or _t%2 != dis%2:
        flag = 'No'
    i += 1        
print(flag)
#97a
a,b,,c,d=map(int,input().split())
print('Yes' if b-a>=d and c-b>=d else 'No')

### FIXED CODE ###

#97a
a,b,c,d=map(int,input().split())

if a<=b<=c or c<=b<=a:
    if abs(a-b)<=d and abs(c-b)<=d:
        print('Yes')

    else:
        print('No')
else:
    if abs(a-c)<=d:
        print('Yes')
    else:
        print('No')
has_seven = False
for i in range(len(str(N))):
  if N[i] == '7':
    has_seven = True
    break
    
if has_seven:
  print("Yes")
else:
  print("No")

### FIXED CODE ###


has_seven = False
N = str(input())
for i in range(len(N)):
  if N[i] == '7':
      has_seven = True
      break

if has_seven:
  print("Yes")
else:
  print("No")
A=[1,6,36,216,1296,7776,46656,9,81,729,6561,59049]
N=int(input())
ans=0
while N!=0:
  N-=max([a for _ in A if A<=N])
  ans+=1
print(ans)

### FIXED CODE ###

N=int(input())
dp=[float("INF")]*(N+1)
dp[0]=0
six,nine=1,1
for i in range(1,N+1):
  if i==six*6:
    six*=6
  if i==nine*9:
    nine*=9
  dp[i]=min(dp[i-1],dp[i-six],dp[i-nine])+1
print(dp[N])
s = input()
if s = "A":
  print("T")
elif s = "C":
  print("G")
elif s = "G":
  print("C")
elif s = "T":
  print("A")

### FIXED CODE ###

s = input()
if s == "A":
  print("T")
elif s == "C":
  print("G")
elif s == "G":
  print("C")
elif s == "T":
  print("A")
n = int(input())
 
if n % 1000 == 0 :
    a = n / 1000
else :
    int(a) = n / 1000 + 1
 
b = a * 1000
answer = int(b - n)
 
print(answer)

### FIXED CODE ###

n = int(input())
 
if n % 1000 == 0 :
    a = n / 1000
else :
    a = int(n / 1000 + 1)
 
b = a * 1000
answer = int(b - n)
 
print(answer)
from collections import Counter
n = int(input())
s = [input() for i in range(n)]

a = Counter(s)
print(type(a))
b = a.most_common()[0][1]

s = list(set(s)) #sの重複した要素を消す


for i in s:
    if s[i] == b:
        print(i)


### FIXED CODE ###

from collections import Counter
n = int(input())
s = [input() for i in range(n)]

a = Counter(s)

b = a.most_common()[0][1]

s = list(set(s)) #sの重複した要素を消す
s.sort()

for i in s:
    if a[i] == b:
        print(i)
while True:
    combNum = 0
    calcResult = 0
    numList1 = list(range(1,n+1,1))
    numList2 = list(range(1,n+1,1))
    numList3 = list(range(1,n+1,1))
    n,x = map(int, input().split())
    if n is x is 0:
        break
    else:
        for index1 in range(n):
            for index2 in range(n):
                for index3 in range(n):
                    #index = [numList1[index1], numList2[index2], numList3[index3]]
                    if numList1[index1] is numList2[index2] or numList1[index1] is numList3[index3] or numList2[index2] is numList3[index3] or numList1[index1] is numList2[index2] is numList3[index3]:
                    #if index.count(numList1[index1])>1 or index.count(numList1[index2])>1 or index.count(numList1[index3])>1:
                        pass                
                    else:
                        if numList1[index1]<numList2[index2]<numList3[index3]:
                            calcResult = numList1[index1] + numList2[index2]+numList3[index3]
                            if calcResult == x:
                                combNum =combNum+1
                        else:
                            pass
    print(combNum)


### FIXED CODE ###

dataNum = 0
combNum = [0] * 100
while True:
    n,x=map(int, input().split())
    if n is x is 0:
        break
    else:
        for a in range(1,n-1):
            for b in range(a+1,n):
                for c in range(b+1,n+1):
                    calcResult = a + b + c
                    if calcResult == x:
                        combNum[dataNum] += 1
                    else:
                        pass
    dataNum += 1

for index in range(dataNum):
    print(combNum[index])
N,M,C = map(int,input().split())
B = list(map(input().split()))
result = 0
for i in range(N):
  C = 0
  A = list(map(input().split()))
  for j in range(M):
    C += B[j]*A[j]
  if sum(C) > 0:
    result += 1
  else:
    None
print(result)

### FIXED CODE ###

N,M,C = map(int,input().split())
B = list(map(int,input().split()))
result = 0
for i in range(N):
  D = 0
  A = list(map(int,input().split()))
  for j in range(M):
    D += B[j]*A[j]
  if D+C> 0:
    result += 1
  else:
    None
print(result)
a.b=[int(x) for x in input().split()]

print(max(a+b,a-b,a*b))

### FIXED CODE ###

a,b=[int(x) for x in input().split()]
 
print(max(a+b,a-b,a*b))
a,b = map(int,input().split())
c = a + b
print("Even" if c % 2 == 0 "Odd" else)

### FIXED CODE ###

a,b = map(int,input().split())
c = a * b
if c % 2 == 1:
  print('Odd')
else:
  print('Even')
n = int(input())
ln = list(map(int, input().split()))

ln.sort()

def binary_search(x, r):
    left = r + 1
    right = n - 1
    while left < right:
        mid = (left + right) // 2
        if ln[mid] == x:
            return mid
        elif ln[mid] > x:
            right = mid - 1
        else:
            left = mid + 1
    mid = (left + right) // 2
    if ln[mid] > x:
        return mid - 1
    else:
        return mid


ans = 0
for a in range(n-2):
    for b  in range(a+1, n-1):
        cmax = ln[b] + ln[a] - 1
        ans += max(0, binary_search(cmax, b) - b)

print(ans)


### FIXED CODE ###

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

if a <= 2*b:
    print(0)
else:
    print(a-2*b)
s = input()
alpha = "abcdefghijklmnopqrstuvwxyz"
tmpset = set()
n = len(s)
if n != 26:
    for i in range(n):
        tmpset.add(s[i])
    for i in range(26):
        if alpha[i] not in tmpset:
            s = s + alpha[i]
            print(s)
            exit()
else:
  jpjk


### FIXED CODE ###

s = input()
alpha = "abcdefghijklmnopqrstuvwxyz"
tmpset = set()
n = len(s)
if n != 26:
    for i in range(n):
        tmpset.add(s[i])
    for i in range(26):
        if alpha[i] not in tmpset:
            s = s + alpha[i]
            print(s)
            exit()
else:
    if s == "zyxwvutsrqponmlkjihgfedcba":
        print(-1)
    else:
        for i in range(n - 1, 0, -1):
            if s[i] > s[i - 1]:
                tmpset.add(s[i])
                for j in range(26):
                    if alpha[j] in tmpset:
                        if s[i - 1] < alpha[j]:
                            s = s[:i - 1] + alpha[j]
                            print(s)
                            exit()
            else:
                tmpset.add(s[i])
a = input()
b = input()
c = 0
for i in range(3):
  if a[a] == b[i]:
    c += 1
print(c)

### FIXED CODE ###

a = input()
b = input()
c = 0
for i in range(3):
  if a[i] == b[i]:
    c += 1
print(c)
N = int(input())
lst = list(map(int,input().split())
output = 1
if 0 in lst :
	print(0)
    quit()
for x in lst :
	output = output * x           
    if output > 10**8 :
    	print(-1)
        quit()
print(output)

### FIXED CODE ###

n = int(input())
ls = list(map(int, input().split()))
res = 1
if 0 in ls:
    print(0)
    quit()
for x in ls:
    res *= x
    if res > 10**18:
        print(-1)
        quit()
print(res)
N, A, B  = [int(x) for x in input().split(" ")]

str = ""
b = 0
r = 0

while b + r <= N:
  for i in range(0,A):
    str = str + "b"*A
    b = b + A
    str = str + "r"*B
    r = r + B

print(list(str)[:N].count("b"))



### FIXED CODE ###

N, A, B  = [int(x) for x in input().split(" ")]

print(int(N/(A+B))*A+int(min(N%(A+B),A)))
n,r = input().split()

if n<10:
	print(r-100*(10-n))
else:
	print(r)

### FIXED CODE ###

n,r = map(int,input().split())
if n < 10:
    print(r+(100*(10-n)))
else:
    print(r)
x=map(int,input().split())
print(x[-1]-x[0])


### FIXED CODE ###

input()
x=sorted(map(int,input().split()))
print(x[-1]-x[0])
import math
import bisect
primes=[2]
top=2
nlist=[2*x-1 for x in range(2,5000)]
while top<math.sqrt(10000):
    top=nlist[0]
    primes.append(top)
    newnlist=[]
    for i in nlist:
        if i%top!=0:
            newnlist.append(i)
    nlist=newnlist
primes=primes+nlist

while(1):
    try:
        n=int(raw_input())
    except:
        break
    if n%2==0:
        if n-1 in primes:
            print 2
        else:
            print 0
    else:
        ans=0
        center=(n+1)/2
        distc=[x-center for x in primes]
        if 0 in distc:
            ans=1
            il=bisect.bisect_left(distc,0)-1
            ir=bisect.bisect_left(distc,0)+1
        else:
            il=bisect.bisect_left(distc,0)-1
            ir=bisect.bisect_left(distc,0)
        while(il>=0 and primes[ir]<n+1):
            if distc[il]+distc[ir]==0:
                ans=ans+2
                il=il-1
                ir=ir+1
            elif distc[il]+distc[ir]<0:
                ir=ir+1
            else:
                il=il-1
            #print ir,il
        print ans

### FIXED CODE ###

import math
import bisect
primes=[2]
top=2
nlist=[2*x-1 for x in range(2,5000)]
while top<math.sqrt(10000):
    top=nlist[0]
    primes.append(top)
    newnlist=[]
    for i in nlist:
        if i%top!=0:
            newnlist.append(i)
    nlist=newnlist
primes=primes+nlist
while(1):
    try:
        n=int(raw_input())
    except:
        break
    if n%2==0:
        if n-1 in primes:
            print 2
        else:
            print 0
    else:
        ans=0
        center=(n+1)/2
        distc=[x-center for x in primes[:bisect.bisect(primes,n)]]
        if 0 in distc:
            ans=1
            il=bisect.bisect_left(distc,0)-1
            ir=bisect.bisect_left(distc,0)+1
        else:
            il=bisect.bisect_left(distc,0)-1
            ir=bisect.bisect_left(distc,0)
        while(il>=0 and ir<len(distc)):
            if distc[il]+distc[ir]==0:
                ans=ans+2
                il=il-1
                ir=ir+1
            elif distc[il]+distc[ir]<0:
                ir=ir+1
            else:
                il=il-1
        print ans
s = int(input())

def func(n):
  if n % 2 == 0:
    return (n/2)
  else:
    return (3n+1)

a = list()
a.append(s)
for i in range(1000):
  a.append(func(a[i]))
for j in range(1001):
  for k in range(1001):
    if (j != k and a[j] == a[k]):
      print(k)
      exit()
      

### FIXED CODE ###

def collatz(n):
    if n%2 == 0:
        return n/2
    else:
        return 3*n+1

s=int(input())
nlist =[]
tmp_in = collatz(s)
nlist.append(s)
nlist.append(tmp_in)
cnt = 1
while True:
    cnt += 1
    tmp_out = collatz(tmp_in)

    if tmp_out in nlist:
        print(len(nlist)+1)
        #print(nlist)
        break
    nlist.append(tmp_out)
    tmp_in = tmp_out
a=int(input())
s=input()

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

### FIXED CODE ###

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

if a >= 3200:
    print(s)
else:
    print("red")
a, b = int(input().split())

if a < 10 and b < 10:
    print(a * b)
else:
    print(-1)



### FIXED CODE ###

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

if a < 10 and b < 10:
    print(a * b)
else:
    print(-1)
import math
a,b,c,d = map(int,input().split())	
lcm = c * d // math.gcd(c, d)
#print(lcm)
def divisor(x):
	
	x_c = math.floor(x/c)
	x_d = math.floor(x/d)
	#print(x_c,x_d)
	x_lcm = math.floor(x/lcm)
	#print(x_c,x_d,x_lcm)
	return x-x_c-x_d+x_lcm
#print(divisor(b),divisor(a))
ans = divisor(b)-divisor(a-1)
print(ans)

### FIXED CODE ###


import fractions
a,b,c,d = map(int,input().split())	
lcm = c * d // fractions.gcd(c, d)
#print(lcm)
def divisor(x):
	
	x_c = x//c
	x_d = x//d
	#print(x_c,x_d)
	x_lcm = x//lcm
	#print(x_c,x_d,x_lcm)
	return x-x_c-x_d+x_lcm
#print(divisor(b),divisor(a))
ans = divisor(b)-divisor(a-1)
print(ans)
M = 1000001
dp = {}
dp[100],dp[101],dp[102],dp[103],dp[104],dp[105] = 1,1,1,1,1,1
def isComb(dp,n):
	for i in range(100,106):
		for j in range(i,106):
			if n-i in dp and n-j in dp and dp[n-i]==1 and dp[n-j]==1:
				return 1
			
	return 0


for i in range(106,M):
	if isComb(dp,i):
		dp[i] = 1
	else:
		dp[i] = 0
n = int(input())
print(dp[n])


### FIXED CODE ###

M = 100001
dp = {}
dp[100],dp[101],dp[102],dp[103],dp[104],dp[105] = 1,1,1,1,1,1
def isComb(dp,n):
	for i in range(100,106):
		for j in range(i,106):
			if n-i in dp and n-j in dp and dp[n-i]==1 and dp[n-j]==1:
				return 1
			
	return 0


for i in range(106,M):
	if isComb(dp,i):
		dp[i] = 1
	else:
		dp[i] = 0
n = int(input())
if n in dp:
	print(dp[n])
else:
	print(0)
# print(dp[n])
import sys
p = [[0 for a in range(10)] for b in range(10)]
def smallink(x,y):
    return [(x+i,y+j) for i in range(-1,2,1) for j in range(-1,2,1)\
            if abs(i)+abs(j)<=1 and x+i>=0 and y+j>=0]
def ink(x,y):
    return [(x+i,y+j) for i in range(-1,2,1) for j in range(-1,2,1)\
             if x+i>=0 and y+j>=0]
def bigink(x,y):
    return [(x+i,y+j) for i in range(-2,3,1) for j in range(-2,3,1)\
            if abs(i)+abs(j)<=2 and x+i>=0 and y+j>=0]

for dataset in sys.stdin:
    x,y,size=map(int,dataset.split(","))
    if size==1:
        L=smallink(x,y)
    elif size==2:
        L=ink(x,y)
    else:
        L=bigink(x,y)
    while len(L)!=0:
        point=L.pop(0)
        p[point[0]][point[1]]+=1

count=0
max=0
for i in range(10):
    for j in range(10):
        if(p[i][j]>max):
            max=p[i][j]
        if(p[i][j]==0):
            count+=1
print count
print max

### FIXED CODE ###

import sys
p = [[0 for a in range(10)] for b in range(10)]
def smallink(x,y):
    return [(x+i,y+j) for i in range(-1,2,1) for j in range(-1,2,1)\
            if abs(i)+abs(j)<=1 and x+i>=0 and x+i<=9 and y+j>=0\
            and y+j<=9]
def ink(x,y):
    return [(x+i,y+j) for i in range(-1,2,1) for j in range(-1,2,1)\
            if x+i>=0 and y+j>=0 and x+i<=9 and y+j<=9]
def bigink(x,y):
    return [(x+i,y+j) for i in range(-2,3,1) for j in range(-2,3,1)\
            if abs(i)+abs(j)<=2 and x+i>=0 and y+j>=0 and x+i<=9\
            and y+j<=9]
for dataset in sys.stdin:
    x,y,size=map(int,dataset.split(","))
    if size==1:
        L=smallink(x,y)
    elif size==2:
        L=ink(x,y)
    else:
        L=bigink(x,y)
    while len(L)!=0:
        point=L.pop(0)
        p[point[0]][point[1]]+=1

count=0
max=0
for i in range(10):
    for j in range(10):
        if(p[i][j]>max):
            max=p[i][j]
        if(p[i][j]==0):
            count+=1
print count
print max
N=int(input())
A=[int(s) for s in input().split(" ")]

Max=max(A)


for i in range(1,Max+1):
    count=0
    if i==1:
        pos=A.pop(0)
    while pos==i:
        count+=1
        pos=A.pop(0)
        if A==[]:
            count+=1
            break
    print(count)

for i in range(N-Max):
    print(0)

### FIXED CODE ###

n = int(input())
A = list(map(int,input().split()))

List = [0] * (n)
for i in range(n-1):
    List[A[i]-1] += 1

for i in List:
    print(i)
H, W = map(int,input().split())
List = [list("." +input()+ ".") for i in range(H)]
B = ["."]*(W+2)
List.insert(0,B)
List.append(B)

for i in range(1,W+1):
  for j in range(1,H+1):
    if List[i][j]=="#" and List[i-1][j]==List[i][j-1]\
        ==List[i][j+1]==List[i+1][j]==".":
      print("No")
      break
  else:
    continue
  break  

else:print("Yes")

### FIXED CODE ###

H, W = map(int,input().split())
List = [list("." +input()+ ".") for i in range(H)]
B = ["."]*(W+2)
List.insert(0,B)
List.append(B)

for i in range(1,H+1):
  for j in range(1,W+1):
    if List[i][j]=="#" and List[i-1][j]==List[i][j-1]\
        ==List[i][j+1]==List[i+1][j]==".":
      print("No")
      break
  else:
    continue
  break  

else:print("Yes")
Z = list(input(""))
N = int(Z[0])
D = int(Z[1])
count = 0
 
while(N--):
  Z1 = list(input(""))
  X = int(Z1[0])
  Y = int(Z1[1])
  
  d = (X**2 + Y**2)**0.5
  
  if d<=D:
    count += 1
    
print(count)

### FIXED CODE ###

Z = input("").split()
N = int(Z[0])
D = int(Z[1])
count = 0
 
while(N):
    Z1 = input("").split()
    X = int(Z1[0])
    Y = int(Z1[1])
  
    d = (X**2 + Y**2)**0.5
  
    if d<=D:
        count += 1
    N = N -1
print(count)
import numpy as np
 
HN = list(map(int, input().split()))
H = HN[0]; N = HN[1]
AB = [list(map(int, input().split())) for _ in range(N)]
 
DP = np.zeros((N,H))
 
for i in range(H):
    DP[0][i] = int((1+i//AB[0][0])*AB[0][1])
 
for i in range(1,N):
    for j in range(H):
        if j<AB[i][0]:
            DP[i][j] = int(min([DP[i-1][j], AB[i][1]]))
        else:
            DP[i][j] = min([DP[i-1][j], DP[i][j-AB[i][0]] + AB[i][1]])
 
print(int(DP[N-1][H-1]))

### FIXED CODE ###

HN = list(map(int, input().split()))
H = HN[0]; N = HN[1]
AB = [list(map(int, input().split())) for _ in range(N)]
 
DP = [[0]*H for i in range(N)]
 
for i in range(H):
    DP[0][i] = int((1+i//AB[0][0])*AB[0][1])
 
for i in range(1,N):
    for j in range(H):
        if j<AB[i][0]:
            DP[i][j] = int(min([DP[i-1][j], AB[i][1]]))
        else:
            DP[i][j] = min([DP[i-1][j], DP[i][j-AB[i][0]] + AB[i][1]])
 
print(int(DP[N-1][H-1]))
num=str(input())

char=list(num)

if char[0]=="9":
	print("Yes")
elif char[1]=="9":
	print("Yes"))
else:
	print("No")
  

### FIXED CODE ###

num=str(input())
 
char=list(num)
 
if char[0]=="9":
	print("Yes")
elif char[1]=="9":
	print("Yes")
else:
	print("No")