Problem:
 Score : 200 points    Problem Statement Takahashi is competing in a sumo tournament.
The tournament lasts for 15 days, during which he performs in one match per day.
If he wins 8 or more matches, he can also participate in the next tournament.  The matches for the first k days have finished.
You are given the results of Takahashi's matches as a string S consisting of o and x .
If the i -th character in S is o , it means that Takahashi won the match on the i -th day; if that character is x , it means that Takahashi lost the match on the i -th day.  Print YES if there is a possibility that Takahashi can participate in the next tournament, and print NO if there is no such possibility.      Constraints  1 \leq k \leq 15  S is a string of length k consisting of o and x .         Input Input is given from Standard Input in the following format:  S       Output Print YES if there is a possibility that Takahashi can participate in the next tournament, and print NO otherwise.        Sample Input 1 oxoxoxoxoxoxox      Sample Output 1 YES  Takahashi has 7 wins and 7 losses before the last match. If he wins that match, he will have 8 wins.       Sample Input 2 xxxxxxxx      Sample Output 2 NO

Solution (Python):
s = input()
nokori = 15 -len(s)
should = 8 -nokori 
num = s.count("o")
if num >= should:
  print("YES")
else:
  print("NO")

Solution (Python):
a = input()

b = a.count('o')

if 8 - b <= 15 - len(a):
    print('YES')
else:
    print('NO')

Solution (Python):
s = input()
if 15-s.count("x")<8: print("NO")
else: print("YES")

Solution (Python):
S = input()
k = len(S)
l = 15 - k
m =S.count("o")
if m + l>= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
s = input()
print('YES' if s.count('o') - len(s) >= -7 else 'NO')

Solution (Python):

s = input()
a = 0

for i in s:
    a += 1 if i == 'o' else 0

if a + 15 - len(s) >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
s = input()
ans = s.rjust(15, 'o').count('o')  >=  8
print(ans and 'YES' or 'NO')

Solution (Python):
from collections import Counter

S = input()
counter = Counter(S)
if counter['x'] <= 7:
  print('YES')
else:
  print('NO')

Solution (Python):
s = input()
print("YES" if s.count("o") + 15-len(s) >= 8 else "NO")

Solution (Python):
print("YNEOS"[input().count('x')>=8::2])

Solution (Python):
S = input()

if 15 - len(S) + S.count('o') >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
S = list(input())


win = S.count("o")

korekara = 8 - win

match = len(S)

nokori = 15 - match

if korekara <= 0:
    print("YES")
elif nokori >= korekara:
    print("YES")
else:
    print("NO")

Solution (Python):
print("NO" if input().count("x") > 7 else "YES")

Solution (Python):
print("NO") if input().count("x") > 7 else print("YES")

Solution (Python):
s = input()
if s.count("x") >= 8:
    print("NO")
else:
    print("YES")

Solution (Python):
S = input()
print("YES" if S.count("x")<8 else "NO")

Solution (Python):
print("NO" if input().count("x")>7 else "YES")

Solution (Python):
S=input()
if S.count('x')<=7:
    print('YES')
else:
    print('NO')

Solution (Python):



def main():
    k = list(input())
    win_count = k.count('o')

    if (win_count + (15 - len(k))) >= 8:
        print('YES')
    else:
        print('NO')


if __name__ == '__main__':
    main()

Solution (Python):
S = input()
num = S.count("x")
if 1 <= len(S) <= 15:
    if 1 <= len(S) <= 7 :
        print("YES")
    else :
        if num >= 8 :
            print("NO")
        else :
            print("YES")

Solution (Python):
if input().count("x") > 7:
  print("NO")
else:
  print("YES")

Solution (Python):

s = input()
ans = s.rjust(15, 'o').count('o') >= 8
print(ans and 'YES' or 'NO')

Solution (Python):
print(("NO","YES")[input().count('x')<=7])

Solution (Python):
print('YES' if input().count('x')<8 else 'NO')

Solution (Python):
S = input()
if S.count('o')+15-len(S) >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
s = input()
o_count = s.count('o')
win_need = 8 - o_count
nokori = 15 - len(s)

if nokori>= win_need:
    print('YES')
else:
    print('NO')

Solution (Python):

S = list(str(input()))
Slen=len(S)
O = S.count("o")
if (15-Slen)+O >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()

k = 0
for c in S:
    if c == "o":
        k += 1

if k + 15 - len(S) >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
count = 0
for i in S:
  if i == "x" :
    count += 1
if count <= 7:
    print("YES")
else:
    print("NO")

Solution (Python):
s = input()
cnt = 0
for i in range(len(s)):
  if s[i] == 'o':
    cnt += 1

if cnt + 15 - len(s) >= 8:
  print('YES')
else:
  print('NO')

Solution (Python):
S=input()
print('YES' if S.count('o') + 15-len(S) >= 8 else 'NO')

Solution (Python):
s = str(input())
if s.count('x')>7:
    ans = 'NO'
else:
    ans = 'YES'
print(ans)

Solution (Python):
S = input()
win = S.count('o')
print('YES' if (15-len(S))+win >= 8 else 'NO')

Solution (Python):
print('YNEOS'[input().count('x')>7::2])

Solution (Python):
s=input();print('YNEOS'[s.count('o')+7-len(s)<0::2])

Solution (Python):
if input().count("x") > 7:
  print("NO")
else:
  print("YES")

Solution (Python):
input_num = input()

plus_count =15 - len(input_num)
win = input_num.count('o')

if win + plus_count >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
s=input()
t=len(s)
o=s.count("o")
n=s.count("x")
if n<8 and t<=15:
    print("YES")
else:
    print("NO")

Solution (Python):
xcounter=0
a=list(input())
for i in range(len(a)):
  if a[i]=="x":
    xcounter+=1
if xcounter>=8:
  print("NO")
else:
  print("YES")

Solution (Python):
s=list(input())

maru = 0
batu = 0
for i in range(len(s)):
  if s[i] == "o":
    maru = maru + 1
  else:
    batu = batu + 1
if 15 - maru - batu >= 8 - maru:
  print("YES")
else:
  print("NO")

Solution (Python):
line = input()
count = 0
for i in line:
  if i == "x" :
    count += 1
if count <= 7: print("YES")
else: print("NO")

Solution (Python):
S=input()
rest = 15-len(S)
N = 0
for i in range(len(S)):
    if S[i]=="o": 
        N+=1
if N+rest>=8:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
k = len(S)
n = 8 - (15-k)
if (n <= 0) or (S.count("o")>=n):
  print("YES")
else:
  print("NO")

Solution (Python):
import sys


def judge(s):
    win = s.count('o')
    if win >= 8:
        return 'YES'

    if (8 - win) <= (15 - len(s)):
        return 'YES'

    return 'NO'


S = input()

print(judge(S))

Solution (Python):
S = input()
day =  15 - len(S)

if((S.count('o') + day) > S.count('x')):
    print('YES')
else:
    print('NO')

Solution (Python):
S = input()
w = 0
for curr in range(len(S)):
    if S[curr] == 'o':
        w += 1

if (15 - len(S)) >= (8 - w):
    print('YES')
else:
    print('NO')

Solution (Python):
n = list(input())
cont1 = 0
for i in range(len(n)):
  if n[i] is 'o':
    cont1 = cont1 + 1
if cont1 >= len(n)-7:
  print('YES')
else:
  print('NO')

Solution (Python):
a = input()
x = [a[i:i+1] for i in range(len(a))]
r = len([s for s in x if s.endswith('x')])
if r >= 8:
	print('NO')
else:
	print('YES')

Solution (Python):

S = input()
w = 15-len(S)
w += sum([s=="o" for s in S])
if w >= 8:
	print("YES")
else:
	print("NO")

Solution (Python):
s = input()
if s.count('o')>= 8:
  print('YES')
elif 15 - len(s)+ s.count('o')>= 8:
  print('YES')
else:
  print('NO')

Solution (Python):
s = input()
x = 0
for i in range(len(s)):
    if s[i] == "x":
        x += 1
if x < 8:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
win = 0
for i in range(len(S)):
    if S[i] == 'o':
        win += 1

if 15 - len(S) + win >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
s=input()
win=0
ls=0
for i in s:
    if i=='x':
        ls+=1
    else:
        win+=1
if len(s)==15:
    if win>=8:
        print('YES')
    else:
        print('NO')

if len(s) < 15:
    if (win+(15-len(s)))>=8:
        print('YES')
    else:
        print('NO')

Solution (Python):
S = [1 if s == 'o' else 0 for s in input()]
k = len(S)
if sum(S) >= 8-(15-k):
    print('YES')
else:
    print('NO')

Solution (Python):
stars = input()
loses = 0
for i in stars:
    if i == 'x':
        loses += 1
print("YES") if loses < 8 else print("NO")

Solution (Python):
s=input()
s = s + "o"*(15-len(s))
print("YES" if 7 < s.count("o") else "NO")

Solution (Python):
S = str(input())
countup = 0
for i in range(len(S)):
  if S[i] == "o":
    countup += 1
if countup + (15 - len(S)) >= 8:
  print("YES")
else:
  print("NO")

Solution (Python):
s = input()

n = s.count("o")+(15-len(s))

if n>=8: print("YES")
else: print("NO")

Solution (Python):
S = input()
win_no = 0
for match in S:
    if match == "o":
        win_no += 1
    
if win_no + 15 - len(S)>= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
s = input()
n = s.count('x')
if n > 7:
    print('NO')
else:
    print('YES')

Solution (Python):
S = input()
if S.count('o') + 15 - len(S) >= 8:
  print('YES')
else:
  print('NO')

Solution (Python):
S = input()


print('YES' if 15 - sum(s=='x' for s in S) >= 8 else 'NO')

Solution (Python):
if input().count("x") < 8:
    print("YES")
else:
    print("NO")

Solution (Python):
S=input()
shori=S.count("o")
if 15-len(S)+shori>=8:
    print("YES")
else:
    print("NO")

Solution (Python):
s = input()

win = 0
lose = 0

for c in s:
    if c == "o":
        win += 1
    else:
        lose += 1

days = 15 - (win + lose)

if win + days >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):

s= input()
day= len(s)
win = s.count('o')
possibility=15-day+win

if possibility >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
string = input()
sum_of_o = 0
for i in string:
    if i == 'o':
        sum_of_o += 1
 
if 15-len(string) >= 8 - sum_of_o:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
C = 0
N = len(S)

for i in range(N):
    if S[i] == "o":
        C = C + 1

if ((15 - N) + C) >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
a = input()
count_all = len(a)
count_win = a.count('o')

if (15 - count_all) + count_win >= 8:
  print("YES")
else:
  print("NO")

Solution (Python):
S=input()
a=S.count('x')
if a>7:
  print("NO")
else:
  print("YES")

Solution (Python):
s = input()
day_current = len(s)
win_count = s.count("o")

if win_count + (15 - day_current) >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
from sys import stdin
import numpy as np


S = input().strip().translate(str.maketrans({'o': '1', 'x': '0'}))
ss = [int(c) for c in S ]

wins = np.sum(ss)

if 15 - len(ss) + wins >= 8 :
    print('YES')
else:
    print('NO')

Solution (Python):



def readInt():
    return int(input())

def readList():
    return list(input().split())

def readListI():
    return list(map(int, input().split()))

def main():
    s = input()
    win = sum(1 for c in s if c == 'o')
    if win+15-len(s) >= 8:
        print("YES")
    else:
        print("NO")


if __name__ == '__main__':
    main()

Solution (Python):
s=input()
if s.count('o') + 15 - len(s) > 7:
    print('YES')
else:
    print('NO')

Solution (Python):


S = list(input())
cnt = 0

for i in S:
    if i == 'x':
        cnt += 1

if cnt >= 8:
    print('NO')
else:
    print('YES')

Solution (Python):
s = str(input())

if s.count('x') >= 8:
    print("NO")
else:
    print("YES")

Solution (Python):
S = input()
ans = 'NO' if S.count('x')>=8 else 'YES'
print(ans)

Solution (Python):
s=input()
print("NO" if s.count("x")>7 else "YES")

Solution (Python):
S=str(input())
k=len(S)
dic = {"o":0,"x":0}
for character in S:
    dic[character] +=1
    
if dic["o"]>=8:
    print("YES")
else:
    if (15-k)>=(8-dic["o"]):
         print("YES")
    else:
        print("NO")

Solution (Python):
S=input()
s=len(S)
ans=S.count("o")
if ans+(15-s)>=8:
    print("YES")
if ans+(15-s)<8:
    print("NO")

Solution (Python):
match=input()
match=list(match)
lmatch=len(match)
cmaru=match.count("o")

cnt=15-lmatch+cmaru


if cnt>=8:
    print("YES")
else:
    print("NO")

Solution (Python):
aryS = list(input())
if aryS.count("x") > 7:
  print("NO")
else:
  print("YES")

Solution (Python):
from collections import Counter
S = input()
c = Counter(S)
res = c['o']+15-len(S)
print('YES' if res >= 8 else 'NO')

Solution (Python):
s = input()
sum = 0
for i in range(len(s)):
    if s[i]=='x':
        sum = sum
    else:
        sum = sum +1
if len(s) < 15:
    sum = sum + 15 - len(s)
if sum >=8:
    print('YES')
else:
    print('NO')

Solution (Python):
x = input()
x_len = len(x)
count_w, count_l = 0,0
for i in range(len(x)):
  if x[i] == 'o':
    count_w += 1
  if x[i] == 'x':
    count_l += 1
    
if 15 - x_len + count_w >= 8:
  print('YES')
else:
  print('NO')

Solution (Python):
s=input()
if(s.count('x')>=8):
    print("NO")
elif((len(s)<15)&(len(s)-s.count('x')+s.count('o')>=8)):
    print("YES")
else:
    print("YES")

Solution (Python):
S=input()
win=0
for i in range(int(len(S))):
  if(S[i]=='o'):
  	win += 1

if(win+15-int(len(S))>=8):
  print("YES")
else:
  print("NO")

Solution (Python):
a = input()
if (15 - len(a))+ a.count("o") >= 8:
  print("YES")
else :
  print("NO")

Solution (Python):
s = input()
count = 0
for i in range(len(s)):
    if s[i] == "x":
        count += 1
n = 15 - count
if n >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
inp = input()
maru = inp.count('o')
batu = inp.count('x')
inp_length = inp.__len__()
if maru > 7 or 15 - inp_length >= 8 - maru:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
nokori = 15 - len(S)
maru = S.count('o')
nokori + maru
if nokori + maru>=8:
    print('YES')
else:
    print('NO')

Solution (Python):
n = input()
if n.count("o") + (15 - len(n)) >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
num = len(S)
if num <= 7:
    print("YES")
else:
    cnt = 0
    for c in S:
        if c == 'o':
            cnt += 1
    rem = num - cnt
    if rem >= 8:
        print("NO")
    else:
        print("YES")

Solution (Python):
print("YES" if input().count("x") <= 7  else "NO")

Solution (Python):




def main():
	c = 0
	s = input()
	for t in s:
		if t == 'o':
			c += 1
	
	c += 15 - len(s)
	
	if c >= 8:
		print('YES')
	else:
		print('NO')


if __name__ == '__main__':
	import sys
	sys.exit(main())

Solution (Python):
import collections

result = list(input())

result_count = collections.Counter(result)
win_count = result_count['o']

remain_days = 15 - len(result) 

if 8 - win_count <= remain_days:
    print("YES")
else:
    print("NO")

Solution (Python):
s = input()
no = s.count('o')
r = 15 - len(s)

print('YES' if r + no >= 8 else 'NO')

Solution (Python):
S=input()
S_list=list(S)
j=0
k=0


for i in S_list:
    j+=1
    if i=='o':
        k+=1

J=15-j
K=J+k


if K<8:
    print('NO')
else:
    print('YES')

Solution (Python):
s=raw_input()
si=15-len(s)
n=s.count('o')
if n+si>7: print "YES"
else: print "NO"

Solution (Python):
import numpy as np
s=np.asarray(list(str(input())))
r=15-s.size
if(8 <= r + np.sum(s=="o")):
  print("YES")
else:
  print("NO")

Solution (Python):
S = list(input())

count_x = 0
for s in S:
    if s == 'x':
        count_x += 1

if count_x >= 8:
    print("NO")
else:
    print("YES")

Solution (Python):
a = input()
if a.count("o") + (15-len(a)) >= 8:
  print("YES")
else:print("NO")

Solution (Python):
A = input()

B = list(A)

C = sorted(B)


D=C.count("o")
if 15-len(C) + D > 7:
    print("YES")
else:
    print("NO")

Solution (Python):
X= input('')
Y=0
Z=0
for i in range(len(X)):
    c = X[i]
    if c == "o" :
        Y += 1
    elif c == 'x' :
        Z += 1
if Z >= 8 :
    print("NO")
else :
    print("YES")

Solution (Python):
print("YES" if input().count('x') <= 7 else "NO")

Solution (Python):
S = input()

ans = "YES"
win = S.count("o")
if(15 - len(S) + win < 8):
    ans = "NO"
print(ans)

Solution (Python):
S=input()
K=len(S)
if (15 - K) +  S.count('o') >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
def main():
    s = input()
    end = len(s)
    win = s.count("o")
    print("YES" if (end - win) <= 7 else "NO")
main()

Solution (Python):
c = input()
if c.count('x') <= 7:
  print("YES")
else:
  print("NO")

Solution (Python):
def main():
    S = input()
    x_count = S.count('x')
    if x_count >= 8:
        print("NO")
    else:
        print("YES")

if __name__ == '__main__':
    main()

Solution (Python):

import sys;
import string;
sys.setrecursionlimit(20000) 

import copy
import itertools

from functools import lru_cache

















s = input()










def doit(s):
  ok = True
  for x in range(m):
    res = 0
    for y in range(a[x][0]):
      if s[a[x][y+1]-1] == 1:
        res = res + 1
    
    if res % 2 != p[x]:
      ok = False
      break
  
  return ok

def createSw(n):
  if n <= 1:
    return [[0,], [1,]]

  ret = []
  for x in createSw(n-1):
    
    ret.append(x + [0])
    ret.append(x + [1])
    
  
  return ret


try:
  res = 0






  l = len(s)
  for x in s:
    if x == 'x':
      res += 1
  print(15 - l, 8 - res, file=sys.stderr)
  if l - res >= 8: 
    print("YES")
  elif res >= 8 or 15 - l < 8 - res:
    print("NO")
  else:
    print("YES")
except Exception as e:
  print("e", e, file=sys.stderr)

Solution (Python):
S = input()
lost = 0
win = 0
for i in S:
    if i == "x":
        lost +=1
    else:
        win += 1

if lost >= 8:
    print("NO")
else:
    if 15 - len(S) + win >= 8:
        print("YES")
    else:
        print("NO")

Solution (Python):
S = input()

len_s = len(S)

win_count = 0
for s in S:
    if s == "o":
        win_count += 1

if win_count + 15 - len_s >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):



a = list(input())

sum = 0
maru = 0

for i in a:
  if i == "o":
    maru += 1
  sum += 1

if 15-sum+maru >= 8:
  print("YES")
else:
  print("NO")

Solution (Python):
s = input()
k = len(s)
o = s.count('o')
if 15 - k + o >= 8:
  print('YES')
else:
  print ('NO')

Solution (Python):
n = input()

x = 0
o = 0

for i in range(len(n)):
  if n[i] == 'o':
    o += 1
  else:
    x += 1
    
if (15 - len(n)) + o >= 8:
  print('YES')
else:
  print('NO')

Solution (Python):

games = input()
count = 0
for game in games:
    if(game == "o"):
        count = count +1
count = count + (15 - len(games))
if(count < 8):
    print("NO")
else:
    print("YES")

Solution (Python):
S = input()
length = len(S)
numOfO = S.count('o')
if (15 - length + numOfO >= 8):
    print("YES")
else:
    print("NO")

Solution (Python):
s = input()
k = len(s)

a = 0

for i in s:
  if i == 'x':
  	a+=1
    
if a>=8:
	print('NO')
else:
	print('YES')

Solution (Python):
result = list(input())

if result.count('x') <= 7:
  print('YES')
else: 
  print('NO')

Solution (Python):
s = raw_input() + 'o' * 15

s = s[:15]

if s.count('o') >= 8:
    print 'YES'
else:
    print 'NO'

Solution (Python):
result = input()
hope = result + (15 - len(result))*'o'
if hope.count('o') >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
s=input()
makeban=0
for i in s:
    if i=="x":
        makeban+=1
if makeban<=7:
    print("YES")
else:
    print("NO")

Solution (Python):
lll = str(input())
l = list(lll)
if(l.count("o")>7):
    print("YES")
elif(l.count("x") <= 7 and l.count("o") <= 8 ):
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
S_count = S.count("o")
remain = 15 - len(S)
if remain + S_count >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
s=input()
if s.count("x")>7:
    print("NO")
else:
    print("YES")

Solution (Python):
S = list(input())
N = len(S)
C = S.count('o')
if C >= 8 or (15 - N) >= (8 - C) :
    print('YES')
else :
    print('NO')

Solution (Python):
S = raw_input()
print "YES" if S.count("o")+(15-len(S))>=8 else "NO"

Solution (Python):
S = input()
if S.count('o') - len(S) >= -7:
    print("YES")
else:
    print("NO")

Solution (Python):
s = map(str,input())
S = list(s)
k = len(S)
count = 15-k
for i in range(k):
  if S[i] == 'o':
    count+= 1
if count >= 8:
  print("YES")
else:
  print("NO")

Solution (Python):
S=str(input())
list1=list(S)
SUM=0
for i in range(len(S)):
  if list1[i]=="x":
    SUM+=1
if SUM>=8:
  print("NO")
else:
  print("YES")

Solution (Python):
str = input()
if str.count('x')>=8:
    print ("NO")
else:
    print("YES")

Solution (Python):
S=input()
w=0
k=0
for i in S:
    if i=="o":
        w+=1
    k+=1
    
TEXT="NO"
if w+(15-k)>=8:
    TEXT="YES"



print(TEXT)

Solution (Python):
S = input()
l = S.count("○") + S.count("x")
if("○" in S) :
  x = S.count("○")
else :
  x = 0
  
if(15 - l + x >= 8) :
  print("YES")
else :
  print("NO")

Solution (Python):

s = str(input())
ans = list(s)

if len(ans) < 8:
    print('YES')
elif len(ans) - ans.count('o') <= 7:
    print('YES')
else:
    print('NO')

Solution (Python):
S=str(input().strip())
if S.count('x')>=8:
    print('NO')
else:
    print('YES')

Solution (Python):
s_list=list(input())

w_count=s_list.count('x')

if w_count<=7:
  print('YES')
else:
  print('NO')

Solution (Python):
S=input()

b=S.count('x')

if((15-b)>=8):
    print("YES")
else:
    print("NO")

Solution (Python):
S=input()
K=len(S)
if (15 - K) +  S.count('o') >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
kekka=list(input())
count=len(kekka)
plus=15-count
c=[]
for w in kekka:
    if w=='o':
        c.append(1)
    else:
        c.append(0)
res=sum(c)+plus
if (int(res)>7):
    print("YES")
else:
    print("NO")

Solution (Python):
s=input()
if s.count("o")+15-len(s)>7:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
c = S.count('o')
l = len(S)

if c > 7:
	print('YES')
else:
	remain = 15 - l
	if remain + c > 7:
		print('YES')
	else:
		print('NO')

Solution (Python):
print("YES" if input().count("x")<8 else "NO")

Solution (Python):
s = input()
s_list = list(s)
cnt = 0
s_len = len(s)

for i in range(len(s)):
    if s_list[i] == "o":
        cnt += 1

if cnt + 15 - s_len >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):


import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    s = lines[0]

    return (s, )


def solve(s, ):

    win = s.count("o")
    lose = s.count("x")
    
    result = "NO"
    if 15 - lose >= 8:
        result = "YES"

    return result

def main():
    

    print("%s" % solve(*parse_input()))


if __name__ == '__main__':

    main()

Solution (Python):
S = input()

sum_maru = sum([1 for c in S if c == 'x'])
if sum_maru >= 8:
    print("NO")
else:
    print("YES")

Solution (Python):
S=input()
nokori=15-len(S)
ablewin=S.count('o')+nokori
if ablewin>=8:
    print('YES')
else:
    print('NO')

Solution (Python):
S = list(str(input()))

if S.count("o") >= 8:
  print("YES")
else:
  if 15 - len(S) + S.count("o") >= 8:
    print("YES")
  else:
    print("NO")

Solution (Python):
S = input()

total_count = 0 
lose_count = 0
for s in S:
  if s == 'x':
    lose_count += 1
  total_count += 1

if lose_count >= 8:
  print('NO')
else:
  print('YES')

Solution (Python):
s = input()

win = s.count("o")

number = len(s)

print("YES" if win + (15 - number) >= 8 else "NO")

Solution (Python):
s = input()
print('YES' if s.count('x') <= 7 else 'NO')

Solution (Python):
def main():
    s = input()
    c = s.count('x')
    if c >= 8:
        print('NO')
    else:
        print('YES')

main()

Solution (Python):
data = input()
if 15 - len(data) + data.count('o') >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
S = list(input())

day = len(S)
win = S.count('o')
lose = S.count('x')
if win >= 8:
    print('YES')
else:
    if (15 - day) + win >= 8:
        print('YES')
    else:
        print('NO')

Solution (Python):
s = input()

num = 0
for i in range(len(s)):
    if s[i] == 'o':
        num += 1
        
if 15 - len(s) >= 8 - num:
    print("YES")
else:
    print("NO")

Solution (Python):
S = str(input())

circles = 0
crosses = 0

length = len(S)
rest = 15 - length


for i in S:
    if i == 'o':
        circles += 1
    else:
        crosses += 1

if rest + circles >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
s = input()
a = 15 - len(s)
cnt = s.count("o")
if a + cnt >=8:
    print("YES")
else:
    print("NO")

Solution (Python):
a = input()
b = int(0)


for i in range(len(a)):
    if a[i]=="x": b=b+1

if b>=8: print("NO")
else: print("YES")

Solution (Python):
S=input()
l=len(S)
w=S.count("o")
if (7-l+w)>=0:
     print("YES")
else:
     print("NO")

Solution (Python):
S = input()


count_o = 0
count_x = 0
for i in S:
    if i == "o":
        count_o += 1
    else:
        count_x += 1

if 15 - len(S) + count_o >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
lose = S.count('x')
if lose >= 8:
    print("NO")
else:
    print("YES")

Solution (Python):
print('NO' if input().count('x')>7 else 'YES')

Solution (Python):
S = input()
c = S.count('o')
if c+15-len(S) > 7:
    print('YES')
else:
    print('NO')

Solution (Python):
s=input()

l=len(s)
count=0

for i in range(l):
    if s[i]=="o":
        count=count+1

f=15-l

if count+f>=8:
    print("YES")
else:
    print("NO")

Solution (Python):
s = input()

victory = s.count('o')
remain = 15 - len(s)

if victory + remain >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
w=0
ipt=input()
for r in ipt:
    if r == 'o':
        w=w+1
if((len(ipt)- 7) > w):
    print("NO")
else:
    print("YES")

Solution (Python):
s = str(input())
if s.count('x') <=7:
    print('YES')
else:
    print('NO')

Solution (Python):
s = input()
if 15-len(s)+s.count('o') > 7:
    print("YES")
else:
    print('NO')

Solution (Python):
import bisect
from operator import itemgetter
import math
import functools
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

s = input()
num = s.count("x")

if num <= 7:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
if S.count('o') >= len(S) - 7:
  print('YES') 
else:
  print('NO')

Solution (Python):
s=input()
a=s.count("x")
if a>=8:
	print("NO")
else:
	print("YES")

Solution (Python):
s = list(input())

N = 15
n = len(s)
rest_n = N - n

win_n = sum([1 if s[i] == 'o' else 0 for i in range(len(s))])

remaining_win_n = 8 - win_n

if rest_n >= remaining_win_n:
    print('YES')
else:
    print('NO')

Solution (Python):
win_or_lose = input()
result = 0
for ind in range(len(win_or_lose)):
    if win_or_lose[ind] == "x":
        result += 1
if result >= 8:
  print("NO")
else:
  print("YES")

Solution (Python):
str = input()
k = len(str)

num_win = 0

for i in range(k):
    if str[i] == 'o':
        num_win += 1

if (15 - k) + num_win >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
S=input()
n=S.count('o')
l=15-len(S)
if n+l>=8:
    print('YES')
else:
    print('NO')

Solution (Python):
S = input()

i = S.count('o') + 15 - len(S)

if i>=8:
	print("YES")
else:
	print("NO")

Solution (Python):
s = input()
if s.count('o') + (15 - len(s)) >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
S = input().rstrip()
result = S.count('x')
print('NO' if result >= 8 else 'YES')

Solution (Python):


s = input()
a = len(s);
b = 15 - a
if s.count('o') + b >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
k = len(S)
wins = 0
for c in S:
    if c == "o":
        wins += 1
max_wins = wins + 15-k
if max_wins >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
o = S.count("o")
x = S.count("x")
n = 15-o-x
ans = "NO"
if n+o >= 8:
  ans = "YES"
print(ans)

Solution (Python):
s = input()

win = s.count('o')

loss = s.count('x')

l = len(s)




if(win>= 8 or 15-l+win >= 8):
	print("YES")

else:
	print("NO")

Solution (Python):
S = str(input())
cnt = 0
for i in range(len(S)):
    if S[i] == "o":
        cnt += 1
    count = i+1
sa = 15 - count 
if (cnt) + sa >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):


k = input()
a = 15 - len(k)
k = k.replace("x", "")
if (len(k)+a) >=8:
    print("YES")
else:
    print("NO")

Solution (Python):
from sys import stdin

s = stdin.readline().rstrip()
maru = s.replace('x','');

if( (len(maru))+ (15-len(s)) >= 8 ) :
  print("YES");
else :
  print("NO");

Solution (Python):
S = input()

print('YES' if S.count('o') + (15 - len(S)) >= 8  else 'NO')

Solution (Python):
k = input()
win_count = 0
lose_count = 0
for i in range (len(k)):
    if k[i] == "o":
        win_count += 1
    else:
        lose_count += 1
if win_count + (15-len(k))>= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()

15 - len(S)

if (15 - len(S)) + S.count('o') >= 8:
    print('YES')

else:
    print('NO')

Solution (Python):
s = input()

a = s.count("o")

if 8-a<=15-len(s):
    print("YES")

else:
    print("NO")

Solution (Python):
list1 = [i for i in input()]
count1 = 0
for i in range(len(list1)):
    if list1[i] == "x":
        count1 += 1

if count1>=8:
    print("NO")
else:
    print("YES")

Solution (Python):
s_li = list(input())
if 15 - len(s_li) + s_li.count('o') >= 8:
    print("YES")
else :
    print("NO")

Solution (Python):
S = str(input())
count = 0

for i in S:
    if i == 'o':
        count += 1

if count + (15 - len(S)) >= 8:
    hantei = 'YES'
else:
    hantei = 'NO'

print(hantei)

Solution (Python):
a = input()
n = 15
o = a.count("o")
x = a.count("x")

if n - x > 7:
    print("YES")
else:
    print("NO")

Solution (Python):
string = input()
S = [s for s in string]

for i in range(int(15 - len(S))):
    S.append("o")

ans = 0
for s in S:
    if s == "o":
        ans += 1
if ans >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):

str1 = input() + "ooooooooooooooo"

count1 = 0

for i in range(15):
    if str1[i] == "o":
        count1 +=1

if count1 >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
from collections import Counter
s = input()
nokori = 15 - len(s)
c = Counter(s)

if c['o'] + nokori >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):




S = input()

count = 0
for i in range(len(S)):

    if S[i] == "x":
       count += 1

if count <= 7:
    print('YES')
else:
    print('NO')

Solution (Python):
s = list(map(str,input()))

count = 0
for i in range(len(s)):
    if s[i] == "o":
        count += 1

x = 15 - len(s)

if count + x >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
count = input().count('x')

if count >= 8:
    print("NO")
else:
    print("YES")

Solution (Python):
s = input()

if s.count("x") <= 7:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()

x = 15 - len(S)
if S.count("o") + x >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):
s=input()
if len(s)<8:
  print("YES")
elif s.count('o')>=len(s)-7:
  print("YES")
else:
  print("NO")

Solution (Python):
N = input()
num = 0
for i in N:
    if i == 'x':
        num += 1
if num >= 8:
    print('NO')
else:
    print('YES')

Solution (Python):
instr = input()
x_count = 0
for i in range(len(instr)):
  
  if instr[i:i+1] == "x":
     x_count += 1
if x_count >= 8:
   print("NO")
else:
  print("YES")

Solution (Python):
S = list(input())
kati = len(S)-S.count("o")
if kati >= 8:
    print("NO")
else:
    print("YES")

Solution (Python):
S = input()
S_list = list(S)

count = 0

for X in S_list:
    if X == 'x':
        count += 1

if count >= 8:
    print('NO')
else:
    print('YES')

Solution (Python):
print(['NO', 'YES'][input().count('x') < 8])

Solution (Python):
S = list(input())
c=0
for i in S:
    if i=='o':
        c+=1
if 15-len(S)+c>=8:
    print("YES")
else:
    print("NO")