Problem:


Score : 100 points

Problem Statement

It is September 9 in Japan now.

You are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?

Constraints

10≤N≤99

Input

Input is given from Standard Input in the following format:

N

Output

If 9 is contained in the decimal notation of N, print Yes; if not, print No.

Sample Input 1

29

Sample Output 1

Yes

The one's digit of 29 is 9.

Sample Input 2

72

Sample Output 2

No

72 does not contain 9.

Sample Input 3

91

Sample Output 3

Yes



Sample input:
29


Sample output:
Yes

Submission status: Runtime Error

Solution code:
N=int(input())
sisterN=[]
SISTERn=[]
SIStern=[]
for n in range(N):
    _=int(input())
    if _<40000:
        _s= _
        if sisterN.count(_s)==1:
            sisterN.remove(_s)
        else:
            sisterN.append(_s)
    elif 40001<_<99990:
        _m= _
        if SISterN.count(_m)==1:
            SISterN.remove(_m)
        else:
            SISterN.append(_m)
    else:
        _b= _
        if SISTERn.count(_b)==1:
            SISTERn.remove(_b)
        else:
            SISTERn.append(_b)

print(len(sisterN)+len(SISTERn)+len(SIStern))

Submission status: Runtime Error

Solution code:
N=int(input())
sisterN=[]
SISTERn=[]
SIStern=[]
for n in range(N):
    _=int(input())
    if _<40000:
        _s= _
        if sisterN.count(_s)==1:
            sisterN.remove(_s)
        else:
            sisterN.append(_s)
    elif 40001<_<99000:
        _m= _
        if SISterN.count(_m)==1:
            SISterN.remove(_m)
        else:
            SISterN.append(_m)
    else:
        _b= _
        if SISTERn.count(_b)==1:
            SISTERn.remove(_b)
        else:
            SISTERn.append(_b)

print(len(sisterN)+len(SISTERn)+len(SIStern))

Submission status: Runtime Error

Solution code:
a = int(input())
print("Yes" if 9 in a else "No")

Submission status: Runtime Error

Solution code:
N = int(input())
if N in 9:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
N = list(input())

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

Submission status: Runtime Error

Solution code:
# -*- coding: <encoding name> -*-

n = int(input())
if '9' in n:
	print('Yes')
else:
	print('No')

Submission status: Runtime Error

Solution code:
# -*- coding: <encoding name> -*-

n = int(input())
if 9 in n:
	print('Yes')
else:
	print('No')

Submission status: Runtime Error

Solution code:
import math
def lcm(n,m): return n*m//math.gcd(n,m)
A,B,C,D=map(int,input().split())
print(((B-A)-(((B-A)//C)+((B-A)//D)))+((B-A)//lcm(C,D)))

Submission status: Runtime Error

Solution code:
s = list(input())

if input[0]=="9" or  input[1]=="9":
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
s = input()

if input[0]=="9" or  input[1]=="9":
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
N = int(input())

if 9 in N :
    print("Yes")
else :
    print("No")

Submission status: Runtime Error

Solution code:
N = int(input())
if "9" in N:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
print('Yes' if '9' in 9list(input(())) else 'No')

Submission status: Runtime Error

Solution code:
##from scipy.sparse.csgraph import csgraph_from_dense,floyd_warshall
import numpy as np
from itertools import permutations
N,M,R = map(int,input().split())
r = list(map(int,input().split()))

"""
https://juppy.hatenablog.com/entry/2018/11/01/%E8%9F%BB%E6%9C%AC_python_%E5%85%A8%E7%82%B9%E5%AF%BE%E6%9C%80%E7%9F%AD%E7%B5%8C%E8%B7%AF%E6%B3%95%EF%BC%88%E3%83%AF%E3%83%BC%E3%82%B7%E3%83%A3%E3%83%AB%E3%83%95%E3%83%AD%E3%82%A4%E3%83%89%E6%B3%95
"""

def warshall_floyd(d):
    n = len(d)
    #d[i][j]: iからjへの最短距離
    for k in range(n):
        for i in range(n):
            for j in range(n):
                d[i][j] = min(d[i][j],d[i][k] + d[k][j])
    return d

graph = [[float("inf") for i in range(N)] for j in range(N)] 
for i in range(M):
    A,B,C = map(int,input().split())
    graph[A-1][B-1] = C
    graph[B-1][A-1] = C

dist = warshall_floyd(graph)

ans = 1e10
for i in permutations(r):
    flag = True
    way = list(i)
    tmp = 0
    for i in range(len(way)-1):
        if dist[way[i]-1][way[i+1]-1] < 0:
            flag = False
            break
        tmp += dist[way[i]-1][way[i+1]-1]
    if flag:
        ans = min(tmp,ans)

print(ans)

Submission status: Runtime Error

Solution code:
N=int(input())
if N[0]=='9' or N[1]=='9':
  print('Yes')
else:
  print('NO')

Submission status: Runtime Error

Solution code:
n = int(input())

a = n//10

b = n-a*10

if a==9 or b==9:
  print("Yes")

else:
  pront("No")

Submission status: Runtime Error

Solution code:
n = int(input())
if n%10==9 or n//10==9:
  print('Yes')
else;
  print('No')

Submission status: Runtime Error

Solution code:
n = int(input())
if n%10==9 or n//10==9:
  print('Yes')
else;
print('No')

Submission status: Runtime Error

Solution code:
N = int(input())
if 9 in N:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import random
a=input()
kekka=['Yes','No']
print(random.choice(kekka)

Submission status: Runtime Error

Solution code:
N = int(input())
print('Yes' if 9 in N else 'No')

Submission status: Runtime Error

Solution code:
N = int(input())
print('Yes' if '9' in N else 'No')

Submission status: Runtime Error

Solution code:
N = str(input())
li = [N[0], N[1]]

if li in '9':
  print("Yes")
  
else:
  print('N0')

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
B = 0
for i in A:
    if A.count(i) != 0:
        if A.count(i)%2 == 1: 
            B += 1
        else:
            while i in A:A.remove(i)
print(B)

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
B=0
for i in A:
    #if A.count(i) >= 1:
    if A.count(i)%2 == 1: 
        B += 1
    else:
        A.remove(i)
print(B)

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
B=0
for i in A:
    #if A.count(i) >= 1:
    if A.count(i)%2 == 0: 
        A.remove(i)
    else:
        B += 1
print(B)

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
for i in A:
    #if A.count(i) >= 1:
    if A.count(i)%2 == 0: 
        A.remove(i)   
print(B)

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
for i in A:
    #if A.count(i) >= 1:
        if A.count(i)%2 == 0: 
            A.remove(i)   
print(B)

Submission status: Runtime Error

Solution code:
N = input()
if "9" in N:
  print("Yes")
else:
  print("No)

Submission status: Runtime Error

Solution code:
n = int(input())

if n[0] == "9" or n[1] == "9":
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
n = int(input())

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

Submission status: Runtime Error

Solution code:
n = int(input())

if n[0] == 9 or n[1] == 9:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
n = int(input())

if n[0] == 9 or n[1] == 9:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
n = int(input())

if n == 19 or n == 29 or n == 39 or n == 49 or n == 59 or n == 69 or n == 79 or n == 89 or n == 91 n == 92 or n == 93 n == 94 or n == 95 or n == 96 or n == 97 or n == 98 or n == 99 :
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
n=int(input())
myset=set()
for i in range(n):
    a=int(input())
    if a in myset:
        myset.remove(a)
    else:
        myset.add(a)
print(len(myset))

Submission status: Runtime Error

Solution code:
n = int(input())
nums = []
for i in range(n):
  num = int(input())
  nums.append(num)
count = 0
setnums = set(nums)
for j in setnums:
  test = nums.count(j)
  if test % 2 == 1:
    count += 1
print(count)

Submission status: Runtime Error

Solution code:
n = int(input())
nums = []
for i in range(n):
    num = int(input())
    nums.append(num)
count = 0
setnums = set(nums)
for j in setnums:
    test = nums.count(j)
    if test % 2 == 1:
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
n = int(input())
nums = []
for i in range(n):
  num = int(input())
  nums.append(num)
count = 0
for j in nums:
  test = nums.count(j)
  if test % 2 == 1:
    count += 1
print(count)

Submission status: Runtime Error

Solution code:
n=input()
4.if n[0]==9 or n[1]==9:
5.    print('Yes')
      exit()
6.else:
7.    print('No')

Submission status: Runtime Error

Solution code:
n=input()
for i in range(len(n)):
    if n[i] ==9:
        print('Yes')
        break
        else:
            print('No')

Submission status: Runtime Error

Solution code:
n = input()
if "9" in n:
    print("Yes")
else:
    print(No)

Submission status: Runtime Error

Solution code:
n =int(input())
ans =0
for i in range(n):
    a, b =map(int, input().split())
    ans +=b-a
    
print(ans)

Submission status: Runtime Error

Solution code:
n = input()

for "9" in n:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
N = int(input())
i =0
ans =0

while i < N:
    a = input().split()
    ans += int(a[1]) - int(a[0]) +1
    i = i + 1
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
i =0
ans =0

while i < N:
    a = input().split()
    

    ans += int(a[1]) - int(a[0]) +1
    i = i + 1
print(ans)

Submission status: Runtime Error

Solution code:
n = (input)
if 9 in n:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
n = int(input())
if '9' in n:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
n = int(input())
if 9 in n:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a = int(input())
if a // 10 = 9:
  print("Yes")
elif a % 10 = 9:
  print("Yes")
else: 
  print("No")

Submission status: Runtime Error

Solution code:
a = int(input())
if a//10=9:
  print("Yes")
elif a%10=9:
  print("Yes")
else: 
  print("No")

Submission status: Runtime Error

Solution code:
n=input()
if ′9′ in n:
  print(′Yes′)
else:
  print(′No′)

Submission status: Runtime Error

Solution code:
N=int(input())
A=[]
for i in range(N):
    A.append(int(input()))
ans=1
li=[A[0]]
for i in range(1,N):
    ans+=1 if li.count(A[i])%2==0 else -1
    li.append(A[i])
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
if n in "9":
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
a = int(input())

for i in range(a):
	if a % 10 == 9:
		print("Yes")
        print(a)
    a = a / 10
    print(a)
#	b, c = map(int, input().split())
#	d = c - b + 1
#	e += d

Submission status: Runtime Error

Solution code:
n = input()
if 9 in n:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
s = input()
print("Yes" if "9" in s else "No)

Submission status: Runtime Error

Solution code:
L = [int(input()) for _ in range(int(input()))]
r = 0
for s in set(L):
    if L.count(s) % 2 == 1:
        r+=1
print(r)

Submission status: Runtime Error

Solution code:
n = int(input())
if '9' in n :
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
n = int(input())
if '9' in n:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a=input()
if a[0] == '9' or a[1] == '9':
  print('Yes')
else:prnit('No')

Submission status: Runtime Error

Solution code:
n=input()
if a[0] == '9' or a[1] == '9':
  print('Yes')
else:prnit('No')

Submission status: Runtime Error

Solution code:
n1, n2 = map(lambda x: int(x), input().split())

if n1 == 9 or n2 == 9:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
N = str( input() )
if str[0] == "9" or str[1] == "9" :
   print( "Yes" )
else : 
   print( "No" )

Submission status: Runtime Error

Solution code:
n = list(input())
if n.index("9"):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = int(input())

print("Yes" if n[0] == 9 or n[1] == 9 else "No")

Submission status: Runtime Error

Solution code:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))

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

if (n//10 == 9) or (n%10==9):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
ああ

Submission status: Runtime Error

Solution code:
import itertools
n,m,r=map(int,input().split());R=min(r,8)
d = [[10**12]*n for j in range(n)]
l=list(map(int,input().split()))
for i in range(r):
  l[i]-=1
for i in range(m):
  a,b,c=map(int,input().split())
  d[a-1][b-1]=d[b-1][a-1] = c
for k in range(n):
  for i in range(n):
    for j in range(n):
      if d[i][j] > d[i][k]+d[k][j]:
        d[i][j]=d[i][k]+d[k][j]
#print(d)
ans=10**12
for v in itertools.permutations(l, R):
  cnt=0
  for i in range(1,R):
    cnt+=d[v[i-1]][v[i]]
  ans=min(ans,cnt)
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input)

k = n//10

a = k%9
b = (n - 10*k)%9

if a == 0 or b == 0:
  ans = 'Yes'
else:
  ans = 'No'

print(ans)

Submission status: Runtime Error

Solution code:
if 9 in input():
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
#f = open('input.txt','r')
input = sys.stdin.readline
#sys.stdin = f

N = int(input())
A = [int(input()) for _ in range(N)]
cntA = [0 for _ in range(max(A)+1)]
for a in A:
    cntA[a] += 1
    cntA[a] %= 2
print(sum(cntA))

Submission status: Runtime Error

Solution code:
n = int(input())
a = set()
for _ in range(n):
    a ^= {input()}
print(len(a))

Submission status: Runtime Error

Solution code:
n=str(input())
print('Yes' if 9 in n else "No")

Submission status: Runtime Error

Solution code:
x, t = map(int, input().split())
print(x - t if x -t > 0 else 0)

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int, M: int, R: int, r: "List[int]", A: "List[int]", B: "List[int]", C: "List[int]"):

    '''
    Warshall-Floyd
    input:  c[|V|][|V|]
            input example to from cost
            (c[i][i] == 0)
    Output: Minimun cost of all paths in the inputed graph 
    '''
    V = N
    INF = 1<<32
    d = [[INF] * (N+1) for i in range(N+1)]
 
    for i in range(M):
        d[A[i]][B[i]] = C[i]
        d[B[i]][A[i]] = C[i]

    for k in range(N+1):
        for i in range(N+1):
            if d[i][k] == INF : continue
            for j in range(N+1):
                if d[k][j] == INF: continue
                d[i][j] = min(d[i][j], d[i][k]+d[k][j])


    ans = INF

    from itertools import product
    for i in product(r,repeat=len(r)):
        # print(i)
        if(len(i) != len(set(i))): continue
        ta = 0
        for j in range(1,len(i)):
            ta += d[i[j-1]][i[j]]
        
        ans = min(ans, ta)
    
    print(ans)

    return


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    R = int(next(tokens))  # type: int
    r = [int(next(tokens)) for _ in range(R)]  # type: "List[int]"
    A = [int()] * (M)  # type: "List[int]"
    B = [int()] * (M)  # type: "List[int]"
    C = [int()] * (M)  # type: "List[int]"
    for i in range(M):
        A[i] = int(next(tokens))
        B[i] = int(next(tokens))
        C[i] = int(next(tokens))
    solve(N, M, R, r, A, B, C)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
n=int(input().split())
if n%10==9 or n/10==9:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
n,m,r=map(int,input().split())

ans=3000000000

def permu(ju,now,su,co):
    if now==0:
        global ans
        ans=min(ans,su)
        return
    else:
        for i in range(r):
            if ju[i]:
                ju[i]=False
                su+=dp[co][rute[i]-1]
                permu(ju,now-1,su,rute[i]-1)
                ju[i]=True
                su-=dp[co][rute[i]-1]
    return

rute=list(map(int,input().split()))
dp=[[30000000 for i in range(n)] for i in range(n)]
for i in range(n):
    dp[i][i]=0
for i in range(m):
    a,b,c=map(int,input().split())
    dp[a-1][b-1]=c
    dp[b-1][a-1]=c
for i in range(n):
    for j in range(n):
        for k in range(n):
            dp[j][k]=min(dp[j][i]+dp[i][k],dp[j][k])


ju=[True for i in range(r)]
for i in range(r):
    ju[i]=False
    permu(ju,r-1,0,rute[i]-1)
    ju[i]=True
print(ans)

Submission status: Runtime Error

Solution code:
n=input()
a=0
for i in range(len(n)):
	if n[i]=="9":
    	a+=1
if a!=0:
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
N = list(int(input()))

if N[0] == 9 or N[1] == 9:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
/Users/isiidaisuke/PycharmProjects/program/venv/bin/python /Users/isiidaisuke/PycharmProjects/program/program.py
89
Yes

Process finished with exit code 0

Submission status: Runtime Error

Solution code:
n = int(input())
print(n.count(9))

Submission status: Runtime Error

Solution code:
N == int(input())
if N//10==9 or N%10==9: print('Yes')
else: print('No')

Submission status: Runtime Error

Solution code:
a = int(input())
if 9 in a:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
x, a, b = map(int,input().split())
if b < a:
    print('delicious')
elif b <= a + x:
    print('safe')
else:
    print('dangerous')

Submission status: Runtime Error

Solution code:
n=int(input())
if "9" in n:
   print("Yes")
else:
   print("No")

Submission status: Runtime Error

Solution code:
n=int(input())
if 9 in n:
print("Yes")
else: 
print("No")

Submission status: Runtime Error

Solution code:
n=int(input())

if 9 in n:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
n=int(input())

if n in 9:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
N=list(input())

flag=0

for i in N:
    if N[i]==9:
        flag+=1
    
if flag==0:
    print('No')
else :
    print('Yes')

Submission status: Runtime Error

Solution code:
n=int(input())
l=[0]*n
for i in range(n):
  l[i]=int(input())
l.sort()
ans=0
c=0
j=0
while len(l)>0:
  while l[j+1]==l[j]:
    c+=1
    j+=1
  c+=1
  if c%2==1:
    ans+=1
  del l[0:c]
  j=0
print(ans)

Submission status: Runtime Error

Solution code:
n=int(input())
l=[0]*n
for i in range(n):
  l[i]=int(input())
l.sort()
ans=0
while len(l)>0:
  if l.count(l[0])%2==1:
    ans+=1
  del l[0:l.count(l[0])]
print(ans)

Submission status: Runtime Error

Solution code:
print(input().replace(" ","-")) for _ in range(int(input())):

Submission status: Runtime Error

Solution code:
sum=0
for _ in range(int(input())):
  a,b=map(int,input().split())
  sum+=b-a+1
print(sum)

Submission status: Runtime Error

Solution code:
a=int(input())
if a in int(9):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
N = int(input())
if 9 in N:
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

Solution code:
a=int(input())
if 9 in a:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
n = int(input())

if n[0]==9 or n[1]==9:
  print('Yes')
  
else:
  print('No')

Submission status: Runtime Error

Solution code:
a,b=int(input())
if a==9 or b==9:
  print("Yes")
elif a==9 and b==9  :
  print("Yes")
elif b!=9         and a!=9 :
  print("No")

Submission status: Runtime Error

Solution code:
N=int(input())
b=list(N)
if b[0]==9 or b[1]==9:
  print("Yes")
elif b[0]==9 and b[1]==9  :
  print("Yes")
elif b[0]!=9         and b[1]!=9 :
  print("No")

Submission status: Runtime Error

Solution code:
a,b=int(input())

if a==9 or b==9:
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
N=int(input())
b=list(N)
if b[0]==9 or b[1]==9:
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
import collections

n = int(input())
a = [int(input()) for _ in range(n)]
b = collections.Counter(a)

cnt = 0
for v in b.values():
    if v % 2 == 1:
        cnt += 1

print(cnt)

Submission status: Runtime Error

Solution code:
N=input()
if any(c=='9'):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = list(int())
if "9" in N:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    s = S()
    if "9" in s:
        print("Yes")
    else:
        print("No")
    return

#B
def B():
    return

#C
def C():
    n = II()
    A = {}
    for i in range(n):
        k = II()
        if not k in A:
            A[k] = 1
        else:
            A[k] += 1
    ans = 0
    #print(A)
    for item in A.values():
        ans += item % 2
    print(ans)
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    C()

Submission status: Runtime Error

Solution code:
x=input().split("")

if x[0]==9 or x[1]==9:
  print("Yes")
else:
  ("No")

Submission status: Runtime Error

Solution code:
x=list(int,input().split())

if x[0]==9 or x[1]==9:
  print("Yes")
else:
  ("No")

Submission status: Runtime Error

Solution code:
N = int(input())
ans = 'No'

if(N//10 == 9):
    ans = 'Yes'
if(N%0 == 9):
    ans ='Yes'

Submission status: Runtime Error

Solution code:
N = int(input())
x = 0
for i in range(N):
  l, r = map(int, input().split())
  x += r - l + 1
print(x)

Submission status: Runtime Error

Solution code:
N=int(input())
ans=0
for i in range(N):
    l,r=map(int,input().split())
    ans=ans+l-r+1
print(ans)

Submission status: Runtime Error

Solution code:
a =int(input())
if "9" in a:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b=input()
LIST=[a,b]
if "9" in LIST:
  print("Yes")
else:
  print("No)

Submission status: Runtime Error

Solution code:
a,b=input().split()
LIST=[a,b]
if "9" in LIST:
  print("Yes")
else:
  print("No)

Submission status: Runtime Error

Solution code:
N = int(input())
result = 0
for i in N:
    if int(i) == 9:
        result += 1
if result >= 1:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
S = input()
if S.count('9') >= 1:
  print('Yes')
elss:
  print('No')

Submission status: Runtime Error

Solution code:
n=int(input())
l=[]
for i in range(n):
  m=int(input())
  l.append(m)
c=0
d=1
e=l[0]
l=sorted(l)
for i in range(1,n):
  if l[i]!=e:
    if d%2==1:
      c+=1
    e=l[i]
    d=1
  else:
    d+=1
if d%2==1:
  c+=1
print(c)

Submission status: Runtime Error

Solution code:
a = int(input())
if a%9==0 or int(a/10)=9:
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

Solution code:
#じゅっぴーフロイド
from collections import*
from itertools import*
def warshall_floyd(d):
    #d[i][j]: iからjへの最短距離
    for k in range(1,n+1):
        for i in range(1,n+1):
            for j in range(1,n+1):
                d[(i,j)] = min(d[(i,j)],d[(i,k)] + d[(k,j)])
    return d

##############################
n,w,r = map(int,input().split()) #n:頂点数　w:辺の数
d = defaultdict(lambda:float("inf"))
*r,=map(int,input().split())
#d[u][v] : 辺uvのコスト(存在しないときはinf)

for i in range(w):
    x,y,z = map(int,input().split())
    d[(x,y)] = z
    d[(y,x)] = z
#print(d)
for i in range(n):
    d[(i,i)] = 0 #自身のところに行くコストは０
d=warshall_floyd(d)
#print(d)
#print([d[i] for i in permutations(r)])
print(min(sum(d[(s,t)]for s,t in zip(i,i[1:]))for i in permutations(r)))

Submission status: Runtime Error

Solution code:
n = int(input())
a = [int(input()) for i in range(n)]
dict = {}
for i in a:
    if i in dict:
        dict[i] += 1
    else:
        dict[i] = 1
ans = 0
for i in dict:
    if dict[i]%2==0:
        continue
    else:
        ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
n = input()
found = 0
for i in n:
        if i == "9":
                print("Yes")
                found = 1
                break

if(!found):
        print("No")

Submission status: Runtime Error

Solution code:
n=int(input())
if n>=90 or n=9 or n=19 or n=29 or n=39 or n=49 or n=59 or n=69 or n=79 or n=89:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a, b = input().split('')

if a == "9" or b == "9":
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split(''))

if a == 9 or b == 9:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = input()
for 9 in n:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
n = input()
if 9 in n:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
n = int(input())
if 9 in n:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
N = int(input())
a = N/10
b = N%10
if a == 9  b == 9:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a = input()
if 9 in a:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a, b=int(input())
if a==9 or b==9:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
n=input()
if "9" in n:
    print("Yes")
elif:
    print("No")

Submission status: Runtime Error

Solution code:
n=input()
if 9 in n:
    print("Yes")
elif:
    print("No")

Submission status: Runtime Error

Solution code:
n=input()
if 9 in n:
    print("Yes")
elif
    print("No")

Submission status: Runtime Error

Solution code:
from itertools import permutations 
inf=10**9
n, m, r1 = map(int, input().split())
r=list(map(int, input().split()))
abc=[list(map(int, input().split())) for _ in range(m)]
d=[[inf]*n for i in range(n)]
for ai, bi, ci in abc:
    d[ai-1][bi-1]=ci
    d[bi-1][ai-1]=ci
for k in range(n):
    for i in range(n-1):
        for j in range(i, n):
            dk=d[i][k]+d[k][j]
            if d[i][j]>dk:
                d[j][i]=dk
                d[i][j]=dk
permutations(r)
ans=inf
p=list(permutations(r))
for pi in p:
    res=0
    for i in range(r1-1):
        res+=d[pi[i]-1][pi[i+1]-1]
    if ans>res:
        ans=res
print(ans)

Submission status: Runtime Error

Solution code:
from itertools import permutations
N, M, R = map(int, input().split())
r = list(map(int, input().split()))
E = [list(map(int, input().split())) for _ in range(M)]
INF = 10 ** 9
d = [[INF for j in range(N)] for i in range(N)]
for i, j, c in E:
    d[i - 1][j - 1] = c
    d[j - 1][i - 1] = c
for k in range(N):
    for i in range(N - 1):
        for j in range(i, N):
            dk = d[i][k] + d[k][j]
            if d[i][j] > dk:
                d[i][j] = dk
                d[j][i] = dk
ans = 10 ** 9
for ri in permutations(r):
    x = 0
    for i in range(R - 1):
        x += d[ri[i] - 1][ri[i + 1] - 1]
    if ans > x:
        ans = x
print(ans)

Submission status: Runtime Error

Solution code:
from itertools import permutations
N, M, R = map(int, input().split())
r = list(map(int, input().split()))
E = [list(map(int, input().split())) for _ in range(M)]
INF = 10 ** 9
d = [[INF for j in range(V)] for i in range(V)]
for i, j, c in E:
    d[i - 1][j - 1] = c
    d[j - 1][i - 1] = c
for k in range(V):
    for i in range(V - 1):
        for j in range(i, V):
            dk = d[i][k] + d[k][j]
            if d[i][j] > dk:
                d[i][j] = dk
                d[j][i] = dk
ans = 10 ** 9
for ri in permutations(r):
    x = 0
    for i in range(R - 1):
        x += d[ri[i] - 1][ri[i + 1] - 1]
    if ans > x:
        ans = x
print(ans)

Submission status: Runtime Error

Solution code:
from itertools import permutations 
inf=10**10
n, m, r = map(int, input().split())
r=list(map(int, input().split()))
abc=[list(map(int, input().split())) for _ in range(m)]
d=[[inf]*n for i in range(n)]
for i in range(n):
    d[i][i]=0
for ai, bi, ci in abc:
    d[ai-1][bi-1]=ci
    d[bi-1][ai-1]=ci
for k in range(n):
    for i in range(n):
        for j in range(i, n):
            d[i][j]=min(d[i][j], d[i][k]+d[k][j])
            d[j][i]=min(d[i][j], d[i][k]+d[k][j])
p=list(permutations(r))
print(min(sum(d[pi[i]-1][pi[i+1]-1] for i in range(len(r)-1)) for pi in p))

Submission status: Runtime Error

Solution code:
from itertools import permutations 
inf=10**10
n, m, r = map(int, input().split())
r=list(map(int, input().split()))
abc=[list(map(int, input().split())) for _ in range(m)]
d=[[inf]*n for i in range(n)]
for i in range(n):
    d[i][i]=0
for ai, bi, ci in abc:
    d[ai-1][bi-1]=ci
    d[bi-1][ai-1]=ci
for k in range(n):
    for i in range(n):
        for j in range(i+1, n):
            d[i][j]=min(d[i][j], d[i][k]+d[k][j])
            d[j][i]=min(d[i][j], d[i][k]+d[k][j])
p=list(permutations(r))
print(min(sum(d[pi[i]-1][pi[i+1]-1] for i in range(len(r)-1)) for pi in p))

Submission status: Runtime Error

Solution code:
N = input()
count = N.count(9)
if count >= 1:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = Input()
ht = false
for char in n:
       if char == ‘9’:
               ht = true
               break
 
if ht :
     print(“Yes”)
else : 
    print(“No”)

Submission status: Runtime Error

Solution code:
n = Input()
ht = false
for char in 'n':
       if char == ‘9’:
               ht = true

if ht :
     print(“Yes”)
else : 
    print(“No”)

Submission status: Runtime Error

Solution code:
n=int(input())
if n in 9:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n=int(input())
if n in "9":
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = input()
b = [int(x) for x in list(str(n))]

for i in b:
    if i in 9:
        print("Yes")
        break