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

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

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

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

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

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

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

Solution (Python):
s = input()
k = len(s)
o = []
x = []
for i,j in enumerate(s):
    if j == 'o':
        o.append(i)
    else:
        x.append(i)

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

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

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

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

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

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

Solution (Python):
S = input()

k = len(S)
win = S.count('o')
lose = S.count('x')

rem = 15 - k 
diff = win - lose

if diff > 0 or rem > (lose - win):
    print('YES')
else:
    print('NO')

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

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

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

Solution (Python):
import sys

s = input()
count = 0

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

if count > 7:
    print('YES')
    sys.exit()


rest = 8 - count


if 15 - len(s) >= rest:
    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 >= 8:
    print("NO")
else:
    print("YES")

Solution (Python):


S = input()

len_S = len(S)
win_number = S.count('o')

if (15 - len_S) + win_number >= 8: 
    print('YES')
else:
    print('NO')

Solution (Python):
''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''

from collections import Counter
gi = lambda : list(map(int,input().strip().split()))
s = input()
print("YES" if (s[:15]+ "o"*(15 - len(s))).count("o") >= 8 else "NO")

Solution (Python):
A=list(input())
sumWin = 0
sumLose = 0
for i in A:
    if i == 'o':
        sumWin += 1
    elif i == 'x':
        sumLose += 1
if sumLose >= 8:
    print('NO')
else:
    print('YES')

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

passedDay = len(S)

if (15 - passedDay) + numO >= 8:
    ans = 'YES'
else:
    ans = 'NO'

print(ans)

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

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

Solution (Python):
S = input()
c = 0
t = 15
for s in S:
    t -= 1
    if s == 'o':
        c+= 1

print('YES' if c+t>=8 else 'NO')

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

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

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

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

cnt = 0
for i in S:
    if(i == "x"):
        cnt +=1
        
if(15-cnt)>7:
    print("YES")
else:
    print("NO")

Solution (Python):
from sys import stdin

def main():
    n = stdin.readline().rstrip()

    if 8 <= n.count('x'):
        print('NO')
    else:
        print('YES')
    
if __name__=='__main__':
    main()

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

Solution (Python):
r = input()
maru = r.replace("x","")
rLength = len(r)
maruCount = len(maru)
remain = 15-rLength
if(maruCount + remain >= 8 ):
  print("YES")
else:
  print("NO")

Solution (Python):
S = input()
count = 0
for e in S:
    if e == 'o':
        count += 1
_s = len(S)
if (15 - _s) + count >= 8:
    print('YES')
else:
    print('NO')

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

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

w = s.count("o")
l = s.count("x")

if (l < 8):
    print("YES")
else:
    print("NO")

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

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

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

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

Solution (Python):
S = list(input())
n_game = len(S)
n_rest_game = 15 - n_game
n_win = 0
n_lose = 0

for s in S:
    if s == 'o':
        n_win += 1
    else:
        n_lose += 1
if 8 - n_win <= n_rest_game:
    print('YES')
else:
    print('NO')

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

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

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

Solution (Python):
str=input()
n=len(str)
count=0
for a in range(n):
    if str[a]== "o":
        count +=1

if count+15-n>=8:
    print("YES")
else:
    print("NO")

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

Solution (Python):
S = input()
wl = list(S)
N = len(S)
win = 0

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

if (15-N)+win >= 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()


lose = S.count("x")

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

Solution (Python):
s = input()
counter = 0

for i in range(len(s)):

    if s[i] == "o":
        counter += 1

a = 15 - len(s) + counter

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

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

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

Solution (Python):
def input_from_console():
    s = input().rstrip()
    return s


def solve(s):
    if s.count('o') + 15 - len(s) >= 8:
        return 'YES'
    return 'NO'


def main():
    s = input_from_console()
    print(solve(s))


if __name__ == "__main__":
    import sys

    if sys.gettrace():  
        check_cases()
    else:
        main()

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('NO')
else:
    print('YES')

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

Solution (Python):

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

Solution (Python):
S = input()
o_, x_ = 0, 0
for s in S:
    if s == "o":
        o_ += 1
    else:
        x_ += 1
if o_ > 7 - (15-len(S)):
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
a = S.count("x")

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):


import math
import sys
import itertools
import numpy as np


sumo = list(input())
lose = 0
for i in range(len(sumo)):
    if sumo[i] == 'x':
        lose += 1
if lose >= 8:
    print("NO")
else:
    print("YES")

Solution (Python):
S = input()
s = []
for c in S:
  s.append(c)


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 = input()
lS = list(S)

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

Solution (Python):
S = input()
count = 0
for s in S:
    if s == "o":
        count += 1

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

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

Solution (Python):


''' 
------------------------
author : iiou16
------------------------
'''

def main():
    S = input()

    win = S.count("o")

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

if __name__ == '__main__':
    main()

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

Solution (Python):
N = input()
N_len = len(N)
remain = 15 - N_len
count = int(N.count("o"))
if count >= 8:
  print("YES")
elif count + remain >= 8:
  print("YES")
else:
  print("NO")

Solution (Python):
S = input()

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

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

Solution (Python):
s = list(input())
count = 0
total = 0
for i in range(len(s)):
    total += 1
    if s[i] == '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 = list(input())
cnt = s.count('o')
rest = 15 - len(s)
ans = 'YES' if cnt + rest >= 8 else 'NO'
print(ans)

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

Solution (Python):
s=input()
l=s.count("x")

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

Solution (Python):

lst_A = list(input())
count = 0
ans = "YES"
for i in range (len(lst_A)):
    if lst_A[i] == "x":
        count += 1
        if count == 8:
            ans = "NO"
            break

print(ans)

Solution (Python):
result = list(input())
count = 0
for i in result:
    if i == "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):
print('YES' if (input().count('x') < 8) else 'NO')

Solution (Python):
S = input()

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

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

l = len(S)
w = S.count("o")

possible_w = 15 - l

ans = "NO"
if w + possible_w >= 8:
    ans = "YES"

print(str(ans))

Solution (Python):
def sumo(S: str)->int:
    left = 15-len(S)
    wins = sum(c == 'o' for c in S)

    return left + wins >= 8


if __name__ == "__main__":
    S = input()

    yes = sumo(S)
    print('YES' if yes else 'NO')

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

n = len(s) - s.count("o")
if n < 8:
  ans = "YES"
else:
  ans = "NO"
print(ans)

Solution (Python):
S = input()
WinNum = S.count('o')


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

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

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

Solution (Python):
s = list(input())
l = len(s)
maru = 0
batu = 0
for a in s:
    if a == "o":
        maru += 1
    else:
        batu += 1
nokori = 15-l
if (nokori+maru)>=8:
    print("YES")
else:
    print("NO")

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

else:
    print('YES')

Solution (Python):
S = input()

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
def lmi(): return list(map(int, input().split()))

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

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

Solution (Python):


S = input()
k = len(S)
num = 0
for i in range(k):
    if S[i] == "x":
        num += 1

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

Solution (Python):
k=input()
if k.count('o') ==7 and k.count('o') == 7:
    print('YES') 
elif k.count('x') < 8:
    print('YES')
else:
    print('NO')

Solution (Python):
S = input()

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

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

Solution (Python):

import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())


S = input()


ls = 15 - len(S)
win = S.count('o')

if win + ls >= 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()
k = len(s)
k = 15 - k
ans = 0
for i in s:
    if i == 'o':
        ans += 1
ans += k
if ans >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
s=input()
v=[]
d=[]
for i in range(len(s)):
  if s[i] == 'o':
    v.append(1)
  elif s[i] == 'x':
    d.append(1)
if len(v)>=8:
  print ('YES')
else:
  if len(d)>=8:
    print ('NO')
  elif 15-(len(v)+len(d))+len(v)>=8:
    print('YES')

Solution (Python):
s = input()

count = 0
for c in s:
    if c=='o':
        count += 1

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

Solution (Python):
S = input()
y_count = 0
n_count = 0
for i in S:
  if i == 'o':
    y_count += 1
  elif i == 'x':
    n_count += 1

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

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

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

if __name__=='__main__':
    main()

Solution (Python):
from __future__ import print_function


import sys
input = sys.stdin.readline

def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd

def lcm(n,m):
    return int(n*m/gcd(n,m))

import re
import array
import copy
import functools
import operator

import collections
import itertools
import bisect
import heapq


from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace

from queue import PriorityQueue as pq



import random


def main():
    l = input().strip()
    cnt=0
    for c in l:
        if c=="o":
            cnt+=1
    eprint(cnt)
    eprint(len(l))
    if 15-len(l)  + cnt >= 8:
        eprint(15-len(l)  + cnt)
        print("YES")
    else:
        eprint(15-len(l)  + cnt)
        print("NO")
    return

if __name__ == '__main__':
    main()

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

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

n_won = len([1 for s in S if s == 'o'])
if n_won + (15 - k) >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
S = input()

o_count = 0
x_count = 0
k = len(S)
amari = 15-k

for i in range(len(S)):
    if S[i] == 'o':
        o_count += 1
    if S[i] == 'x':
        x_count += 1

if o_count + amari >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
data = list(input())
nokori = 15 - len(data)
win = 0

for r in data:
    if r == 'o':
        win = win + 1
if win + nokori >= 8:
    print('YES')
else:
    print('NO')

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

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

Solution (Python):
import math

n = list(map(str, input().split()))
n=n[0]

yes=0
no=0

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

Solution (Python):
import numpy as np

S  = input()
win_count = S.count('o')

remain_days = 15 - len(S)
remain_wins = 8 - win_count

if remain_wins <= remain_days:
    print('YES')
else:
    print('NO')

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

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

Solution (Python):

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

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

print(Answer)

Solution (Python):
s = input()

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

Solution (Python):
import sys

input = sys.stdin.readline

L = list(input().rstrip())
n = L.count('o')
ans = 15 - len(L) + n
if ans >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):


import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

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

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

s = list(s)

win_number = s.count('o')

possible_win_number = win_number + (15 - len(s))

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

Solution (Python):
a=input()
k=len(a)
n=0
count=0
while True:
    if a[n]=="o":
        count+=1
    n+=1
    if n==k:
        break
if 15-k+count>=8:
    print('YES')
else:
    print('NO')

Solution (Python):

s=input()

co = 0
for i in range(len(s)):
    if s[i] == "x" :
        co += 1
if co>=8 :
    print("NO")
else:

    print("YES")

Solution (Python):
S=input()
lose = S.count("x")

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

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

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

Solution (Python):
S = [i for i in input()]      
leng = len(S)                 
count = S.count("o")          
if count+(15-leng)>=8:        
    print("YES")              
else:                         
    print("NO")

Solution (Python):
s = input()
cnt = 0
for x in s:
    if x == 'x':
        cnt += 1
if cnt < 8:
    print('YES')
else :
    print('NO')

Solution (Python):
from sys import stdin
import math
import itertools


def makeIntMatrix(lines):
    intMatrix = []
    for a in makeStringMatrix(lines):
        intMatrix.append([int(b) for b in a])
    return intMatrix
 
 
def makeStringMatrix(lines):
    stringMatrix = [line.split() for line in lines]
    return stringMatrix
 
 
def makeInt(line):
    return int(line.rstrip())
 
 
def makeMultiInteger(line):
    return [int(x) for x in line.rstrip().split()]


def solve(input_string):
    a = input_string[0].rstrip()
    c = 0
    for i in a:
        if i == 'o':
            c += 1

    for i in range(14-len(a)):
        c += 1
    if c >= 7:
        return 'YES'
    else:
        return 'NO'





def main():
    input_lines = stdin.readlines()
    answer = solve(input_lines)
    print(answer)


if __name__ == '__main__':
    main()

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

Solution (Python):
S = input()
k = len(S)
n_o = S.count("o")

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

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

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

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

Solution (Python):
S = (input() + "o"*14)[:15]
if (len(list(filter(lambda s: s == "o", S))) > 7):
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()
o_count = 0
x_count = 0
for s in S:
    if s == 'o':
        o_count += 1
    else:
        x_count += 1

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

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

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

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

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

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

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

Solution (Python):
s = input()
lost = 0
k = len(s)
for c in s:
    if c == 'x':
        lost += 1
if lost >=8:
    print('NO')
else:
    print('YES')

Solution (Python):
S = input()

rem = 15-len(S)
win = sum([1 for s in S if s == "o"])

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

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

Solution (Python):
S = input()
co = 0
for s in S:
    if s == "x":
        co += 1



if len(S) > 7 and co >=8:
    print("NO")
else:
    print("YES")

Solution (Python):
S = input()

nx = 0
for c in S:
    if c=='x': nx+=1

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

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


sum=0
for i in range(N):
  if S[i]=="o":
    sum=sum+1
  
if sum+15-N>7:
  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):
S = list(input())
win = S.count('x')
if win < 8:
  print('YES')
else:
  print('NO')

Solution (Python):
s = input().rstrip()

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

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

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

Solution (Python):
s = input()

remain_match = 15 - len(s)
win = s.count("o")

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

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

Solution (Python):
s=input()
a=s.count('o')
b=s.count('x')
if b>=8:ans='NO'
elif 15-b>=8:ans='YES'
print(ans)

Solution (Python):
s = raw_input()

batu_count = 0
for result in s:
    if result == 'x':
        batu_count += 1

if batu_count >= 8: print 'NO'
else: print 'YES'

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

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

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

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

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

Solution (Python):


import sys

if sys.stdin.readline().count("x")<=7: print( "YES" )
else: print( "NO" )

Solution (Python):
S=input()
S_replace=S.replace('x','')
add_days = 15-len(S)

if len(S_replace)+add_days >= 8:
    print("YES")
else:
    print("NO")

Solution (Python):

chars = input()
cnt = 0
for char in chars:
    if char == 'o':
        cnt += 1
if (cnt + 15 - len(chars)) >=  8:
    print ("YES")
else:
    print ("NO")

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

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

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

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

Solution (Python):
S = [str(i) for i in input().split()][0]

count = S.count('x')

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

Solution (Python):
S = input()
S.split(',')

lenS = len(S)
maru = 0

for i in range(lenS):
    if S[i] == 'o':
        maru += 1
    else:
        maru = maru
if 15-lenS + maru >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
s = input()

kati = s.count('o')
nokori = 15 - len(s)

if kati + nokori >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):

import sys

YES = "YES"  
NO = "NO"  

def solve(S: str):
    if(15-len(S)+S.count('o') >= 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()
f = 0
for i in range(len(S)):
 if S[i] == "o":
  f += 1
if 15 - len(S) + f >= 8:
 print("YES")
else:
 print("NO")

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

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

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

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

Solution (Python):


import math

def main():
    n = list(raw_input())
    cnt = 0
    total = 0
    for i in n:
        if i == 'x':
            total += 1
    if total >= 8:
        print "NO"
    else:
        print "YES"

if __name__ == "__main__":
    main()

Solution (Python):
import sys

S = input()

x_cnt = 0
for st in S:
    if st == 'x':
        x_cnt += 1

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

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

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

Solution (Python):

S = input()

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

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

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

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

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

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

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

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

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

Solution (Python):
s = input()
k = len(s)
o = s.count('o')
if o >= 8:
  ans = True
else:
  if 15 - k >= 8 - o:
    ans = True
  else:
    ans = False

if ans is True:
  print('YES')
else:
  print('NO')

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

Solution (Python):

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


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

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

Solution (Python):
S = str(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 = str(input())
cnt = 0
for i in S:
    if i == 'x':
        cnt += 1
if cnt < 8:
    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()
valid = 0
left = 15 - len(s)
for tok in s:
    if tok == 'o':
        valid += 1
if valid + left >= 8:
    print('YES')
else:
    print('NO')

Solution (Python):
S = input()

win = S.count("o")
lose = S.count("x")

if win > 7:
    print("YES")
elif 15 - len(S) + win > 7:
    print("YES")
else:
    print("NO")

Solution (Python):
S = input()

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

Solution (Python):
letters = input()
okay = 0
nokay = 0
for i in letters:
  if i == 'o':
    okay += 1
  else:
    nokay += 1
rest = 15 - okay - nokay
if okay+rest >= 8:
  print("YES")
else:
  print("NO")