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()

k = len(s)
win = 0

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

if k < 7:
	print('YES')
elif k >= 8:
	if win + (15 - k) >= 8:
		print('YES')
	else:
		print('NO')

Solution (Python):
S = input()
count = 0
for s in S:
  if s == 'o':
    count += 1
if count + (15 - len(S)) >= 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()
print("YNEOS"[S.count("o")+15-len(S)<8::2])

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

Solution (Python):
print('NYOE S'[input().count('x')<8::2])

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

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

Solution (Python):

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

Solution (Python):
S = input()
loseCount = 0

for n in range(len(S)):
    if S[n] == "x":
        loseCount = loseCount + 1

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

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

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

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

Solution (Python):


S = input()

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

Solution (Python):
S = input()

cnt = 0
for c in S:
  if c == 'x':
    cnt += 1
    
print('NO' if cnt > 7 else 'YES')

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

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

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

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

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

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

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

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

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

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

Solution (Python):
S = input()

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

Solution (Python):
s = input()

cnt = 0
for i in s:
    if (i == 'o'):
        cnt += 1
print('YES' if len(s) - cnt <= 7 else 'NO')

Solution (Python):
from sys import stdin

s = stdin.readline().rstrip()
point = 0
for i in s:
    if i == "x":
        point += 1
if point >= 8:
    print("NO")
else:
    print("YES")

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

Solution (Python):
A = input()
count = 0
for i in A:
  if i == 'o':
    count += 1
b = len(A) - count
if 15 - b > 7:
  print('YES')
else:
  print('NO')

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


if __name__ == '__main__':
    main()

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    S=ST()
    if 15-len(S)+S.count("o")>=8:
        print("YES")
    else:
        print("NO")
if __name__ == '__main__':
    main()

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

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

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

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

res = 15 - k

must = 8 - res

win = s.count("o")

if win < must:
	print("NO")
else:
	print("YES")

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

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

Solution (Python):
s = input()

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

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

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

x = 15 - len(s)
y = s.count('o')

if x + y >= 8:
    print('YES')
else:
    print('NO')

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

Solution (Python):
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    s = str(input().rstrip('\n'))
    print("YES" if s.count("x") < 8 else "NO")


if __name__ == '__main__':
    solve()

Solution (Python):
s = input()

l = len(s)
temp = 0
for i in s:
	if i =="o":
		temp+=1

if (8-temp) <= 15-l:
	print("YES")
else:
	print("NO")

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

Solution (Python):

s = input()

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

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

Solution (Python):

def examB():
    S = SI()
    ans = "YES"
    if S.count("x")>=8:
        ans = "NO"
    print(ans)

from string import digits
import sys,copy,bisect,itertools,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examB()

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

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

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

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

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

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

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

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

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

Solution (Python):
S=input()
print(("NO","YES")[S.count("o")+(15-len(S))>=8])

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

Solution (Python):
s = input()

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

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

s = input()
n = len(s)
if s.count('o') + 15 - n >= 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 = input().strip()
k = len(S)
n = S.count("o")
if n+15-k>=8:
    print("YES")
else:
    print("NO")

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

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

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

Solution (Python):
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    s = str(input().rstrip('\n'))
    print("NO" if s.count("x") >= 8 else "YES")


if __name__ == '__main__':
    solve()

Solution (Python):
s=input()
S=list(s)
k=len(S)
count=0
for i in range(k):
    if S[i]=='o':
        count+=1
    else:
        continue
if 15-k+count>7:
    print('YES')
else:
    print('NO')

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

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

Solution (Python):
import sys


def slove():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    s = str(input().rstrip('\n'))
    print("YES" if s.count("o") >= 8 - (15 - len(s)) else "NO")


if __name__ == '__main__':
    slove()

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

Solution (Python):
s = input()
n = 0
m = 15 - len(s)

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

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

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

Solution (Python):
s = input()
w=0
l=0
for x in s:
    if x is 'o':
        w+=1
    else:
        l+=1
if w+15-l-w>=8:
    print("YES")
else:
    print("NO")

Solution (Python):
s=input()
b=len(s)
a=7-b
for i in range(b):
    if s[i]=="o":
        a+=1
if a>=0:
    print('YES')
else:
    print('NO')

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

Solution (Python):
s = input()

if s.count('x') > 7:
    print('NO')
else:
    print('YES')

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

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

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

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

Solution (Python):
record = input()

wins = 0

for match in record:
    if(match == "o" or match =="O"):
        wins += 1

matchesPlayed = len(record)

if(15 - matchesPlayed + wins > 7):
    print("YES")
else:
    print("NO")

Solution (Python):

matches = input()
matches_list = list(matches)

x = 0
for i in matches_list:
  
  
  if i == 'x':
    x += 1

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

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

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


if __name__ == "__main__":
    resolve()

Solution (Python):


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

Solution (Python):
s=input()

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

Solution (Python):



import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

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

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

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

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

Solution (Python):
m = list(map(str,input()))
maru = m.count('o')
batsu = m.count('x')

if batsu > 7:
  print('NO')
else:
  print('YES')

Solution (Python):
S = input()
c = 0
for s in S:
  if s == "x":
    c += 1
if c >= 8:
  print("NO")
else:
  print("YES")

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

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

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

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

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

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

Solution (Python):

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

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

Solution (Python):
S = input()

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

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

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

Solution (Python):
S = input()

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

Solution (Python):
s = input()

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

Solution (Python):
s = input()

if s.count('x') < 8:
    print('YES')
else:
    print('NO')

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

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

Solution (Python):
s = input()
count = 0
for a in range(len(s)):
    if(s[a] == 'x'):
        count += 1

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

Solution (Python):
s = input()

if s.count('x') < 8:
    print('YES')
else:
    print('NO')

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

Solution (Python):
S = input()
cnt = 0
for s in S:
    if s == "x":
        cnt += 1
    if cnt >= 8:
        print("NO")
        exit()
print("YES")

Solution (Python):
S = str(input())
count_y = 0
count_n = 0
for i in range(len(S)):
  if S[i] == "o":
    count_y += 1
  else:
    count_n += 1
  if count_n>7:
    print("NO")
    exit()
print("YES")

Solution (Python):
S = list(input())
K, L = len(S), S.count("x")
print("YES" if -L + 15 >= 8 else "NO")

Solution (Python):
S=input()

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

Solution (Python):
if str(input()).count("x") <= 7:
  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):
S = input()
w = 0
for i in range(len(S)):
  if S[i] == "o":
    w += 1
r = w + (15-len(S))
if r >= 8:
  print("YES")
else:
  print("NO")

Solution (Python):


import sys
import copy

sys.setrecursionlimit(1000000)





S = input().rstrip()

win = 0
length = len(S)

for i in range(length):
    if S[i] == 'o':
        win += 1

win += 15 - length

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

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

Solution (Python):
def solve(s):
    return "YES" if 7 >= s.count("x") else "NO"

s = input()
print(solve(s))

Solution (Python):
import numpy as np

k = input()
n = [1 if i=="o" else 0 for i in k]

num = 15 - len(n)
if num >= 8-sum(n):
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()

t = S.count("x")

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

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

Solution (Python):
S = input()

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

Solution (Python):



'''n=int(input())
for i in range(0,n):
    o=int(input())
    p=input().rstrip().split(' ')
    l=[0]*3;
    for j in range(0,len(p)):
        l[(int(p[j])%3)]+=1;
    s=0;
    s+=l[0];
    s+=min(l[1],l[2])
    if min(l[1],l[2])==l[2]:
        l[1]-=l[2]
        s+=(l[1]//3)
    elif min(l[1],l[2])==l[1]:
        l[2]-=l[1]
        s+=(l[2]//3)
    print(s)'''



s=input().rstrip()
x=list(s)
T=0;
for i in range(0,len(x)):
    if x[i]=='o':
        T+=1;
T+=(15-len(x))
if T>=8:
    print("YES")
else:
    print("NO")

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

Solution (Python):
S = input()

batsu = 0
for i in range(len(S)):
    if S[i] == 'x':
        batsu += 1

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

Solution (Python):




S = input()


S_list = []
for i in range(0,len(S)):
    S_list.append(S[i])



Nvic = S_list.count("o")

if Nvic + 15 - len(S) < 8:
    print("NO")
else:
    print("YES")

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

Solution (Python):
import numpy as np
str = input()
char_list = list(str)
lest_win=8-char_list.count("o")
lest_day=15-len(char_list)
if lest_win > lest_day:
    print("NO")
else:
    print("YES")

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

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

Solution (Python):
import sys
s = sys.stdin.readline().rstrip()
if len([y for y in s if y == 'x']) >= 8:
  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()
if S.count('x') < 8:
  print("YES")
else:
  print("NO")

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

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

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

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

Solution (Python):
S = input()
cnt = 0
for i in range(0, len(S)):
	if S[i] == 'x': cnt += 1
if cnt < 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):
from sys import exit

S = input()

min_win = len(S) - 7

win_count = 0

for s in S:
    if s == 'o':
        win_count += 1

if win_count >= min_win:
    print('YES')
else:
    print('NO')

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

Solution (Python):
S = input()

print(["YES", "NO"][not(8 <= ((15 - len(S)) + S.count("o")))])

Solution (Python):
s = input()

i_win = s.count('o')
k = len(s)

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

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

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

Solution (Python):
nyuuryoku=input()
a=list(nyuuryoku)
win=a.count('o')
lose=a.count('x')
day=len(a)
if (15-day)+win>=8:
  print('YES')
else:
  print('NO')

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

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

Solution (Python):
km = input()


m = km.count('x')

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

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

Solution (Python):
n = len([s for s in input() if s == "x"])
if n < 8: print("YES")
else: print("NO")

Solution (Python):


"""
oj dl https://atcoder.jp/contests/abc116/tasks/abc116_d -d test-d
oj test -d test-d -c "python abc116d.py"
oj test -d test-d -c "python abc116d.py" test-d/sample-3.in
"""
from collections import defaultdict
import sys
import math
from datetime import datetime

def sol(S):
    
    c = 0
    for s in S:
        if s == 'o': c+=1
    return 'YES' if 15 - len(S) + c >= 8 else 'NO'


do_submit = True


def input_parse(input_str):
    lines = [x.strip() for x in input_str.split("\n") if x.strip()]
    parsed_lines = [list(map(str, line.split())) for line in lines]
    print(parsed_lines)
    
    S = parsed_lines[0][0]
    
    
    
    return S


if not do_submit:
    S = input_parse("""
    oxoxoxoxoxoxox
    """)
    print(sol(S))

    S = input_parse("""
    xxxxxxxx
    """)
    print(sol(S))

else:
    
    
    
    S = input().strip()
    
    print(sol(S))

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

win = 0

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

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

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

Solution (Python):
s = input()
o = s.count('o')

ans = "YES" if o + (15 - len(s)) > 7 else "NO"
print(ans)

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

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

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

Solution (Python):
import collections

S = [s for s in input()]
k = len(S)
c = collections.Counter(S)
if 15 - k + c["o"] >= 8:
  print("YES")
else:
  print("NO")

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

Solution (Python):
import sys
input = sys.stdin.readline

S = list(input().strip())

m = {
    "o": 0,
    "x": 0,
}

for v in S:
    m[v] += 1
    
if m["x"] < 8:
    print("YES")
else:
    print("NO")

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

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

Solution (Python):
S=input()
o=15-len(S)+S.count('o')

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

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

Solution (Python):
S = input()

result = (15 - len(S) + S.count("o")) >= 8

if result:
    print("YES")
else:
    print("NO")

Solution (Python):
s= input()
win_num = s.count("o")
rest_game = 15-len(s)

if win_num + rest_game>=8:
    print("YES")
else:
    print('NO')

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

Solution (Python):


S = input()
le = len(S)


win = (S.count('o'))


zan = 15 - le

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

Solution (Python):


S=input()

total = len(S)
zan = 15 - total

win = S.count('o')


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

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

Solution (Python):

import sys

YES = "YES"  
NO = "NO"  
K = 15

def solve(S: str):
    count =  S.count("o")
    if count >= 8:
        print("YES")
    else:
        rest = K - len(S)
        if count + rest >= 8:
            print("YES")
        else:
            print("NO")
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

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

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

Solution (Python):
s = input()

cnt = 0
for c in s:
    if c == 'x':
        cnt += 1
if cnt >= 8:
    print("NO")
else:
    print("YES")

Solution (Python):

S = input()


Batsu = int(S.count('x'))
Nokori = 15 - Batsu


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

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

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

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

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

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

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

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

Solution (Python):
q = input()
a=0
for i in q :
	if i == 'x' : a+=1

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

Solution (Python):



import math
import statistics

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

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

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

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

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

for i in n :
    if i == 'o' :
        c +=1
        
if c >= 8 or (8-c) <= 15 - len(n) :
    print('YES')
else :
    print('NO')

Solution (Python):
s = input()

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

if ans >= 8:
    print("YES")

else:
    print("NO")

Solution (Python):
S = input()

cnt = 0
for i in S:
    if(i=='o'):
        cnt += 1
if(15-len(S)+cnt>=8):
    print('YES')
else:
    print('NO')

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

Solution (Python):
s = input()

n_win = sum([1 for ss in s if ss == 'o'])
ans = 'YES' if 15-len(s) >= 8-n_win else 'NO'
print(ans)

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

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

Solution (Python):


import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy





s = input()

l = len(s)

w = len(list(filter(lambda c: c == 'o', s)))

print('YES' if 15 - l + w >= 8 else 'NO')

Solution (Python):
S = input()

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

Solution (Python):
S = input()
cnt = 0

for s in S:
    if s == "x":
        continue

    else:
        cnt += 1

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

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    S = [1 for c in input().strip() if c == 'x']
    if sum(S) >= 8:
        return 'NO'
    else:
        return 'YES'

if __name__ == '__main__':
    print(main())

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

Solution (Python):
s = input()
win = s.count('o')

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

Solution (Python):


from collections import deque
import itertools as ite
import sys
import math

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

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

Solution (Python):
s = raw_input()
c = 0
for ch in s:
  if ch == 'x':
    c += 1
if c <= 7:
  print 'YES'
else:
  print 'NO'

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


if len(s) < 15:
    for _ in range(15-len(s)):
        s.append('o')

cnt = 0
for r in s:
    if r == 'o':
        cnt += 1

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

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

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

Solution (Python):


S = input().strip()
if S.count("x") >= 8:
    print("NO")
else:
    print("YES")

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

Solution (Python):
s = input()
s = s + "o" * (15 - len(s))

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

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

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

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

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

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

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