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

import sys
def input():
    return sys.stdin.readline()[:-1]

def main():
    S = input()

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

if __name__ == '__main__':
    main()

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

Solution (Python):
s=input()
s_num=len(s)
t=""
t+=s+"o"*(15-s_num)
s_win=t.count("o")
print(["NO","YES"][s_win>=8])

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

Solution (Python):
s = input()
n = len(s)
count_win = s.count('o')
count_trial = 15 - n

if count_trial >= 8 - count_win:
    print('YES')
else:
    print('NO')

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

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

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

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

Solution (Python):
def main():
    s = input()
    x = 15 - len(s)

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

if __name__ == "__main__":
    main()

Solution (Python):
s = input()
w = 0
for item in s:
    if item == 'o':
        w += 1

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

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

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

Solution (Python):
'''
Created on 2020/09/06

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  S=pin()[:-1]
  t=S.count("o")
  u=len(S)
  if 15-u+t>=8:
    print("YES")
  else:
    print("NO")
  return 
main()

Solution (Python):
 
s=input()
k=15-len(s)
if s.count('o')+k >= 8:
    print('YES')
else:
    print('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=list(input())
sum=15-len(S)
S.sort()
for i in S:
    if i=='o':
        sum+=1
    if sum>=8:
        print("YES")
        break
    if i=='x':
        print("NO")
        break

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    S = input()
    l = len(S)
    x = S.count("o")
    y = 15 - l

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


if __name__ == '__main__':
    main()

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

Solution (Python):

S = input()

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

Solution (Python):
s=input()
n=len(s)
tmp=0
for i in range(n):
    if s[i]!="o":
        tmp+=1
if tmp>7:
    print("NO")
else:
    print("YES")

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


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    S = SS()

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

if __name__ == '__main__':
    resolve()

Solution (Python):
s = input()
remain=15-len(s)

maru=0
for i in s:
    if i =='o':
        maru+=1
        
if remain >= 8-maru:
    print('YES')
else:
    print('NO')

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

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

Solution (Python):

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

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

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

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

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

Solution (Python):
import sys, math
from functools import lru_cache
sys.setrecursionlimit(500000)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]

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


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    S = readline().decode('utf-8').strip()
    if S.count('o') + (15-len(S)) >= 8:
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
    main()

Solution (Python):
'''
自宅用PCでの解答
'''
import math

import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit


ipt = stdin.readline
setrecursionlimit(10**7)
mod = 10**9+7
alp = "abcdefghijklmnopqrstuvwxyz"

def main():
    s = input()
    n = len(s)
    nm = 0
    for i in s:
        if i == "o":
            nm += 1

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

    return None

if __name__ == '__main__':
    main()

Solution (Python):
s = input()
day = 15 - len(s)
count = s.count("o")
if count + day >= 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):
import math
import sys
import collections
import bisect
readline = sys.stdin.readline


def main():
     print('YES' if list(readline().rstrip()).count('x') < 8 else 'NO')

if __name__ == '__main__':
    main()

Solution (Python):
S = input()

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

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

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

win = s.count('x')

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

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

Solution (Python):
S = input()
K = len(S)

N = S.count("o")

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

Solution (Python):
S = input()

xCount = 0
for s in S:
    if s == "x":
        xCount += 1

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

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

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

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

Solution (Python):
print('YES' if sum([c=='x' for c in input()])<8 else 'NO')

Solution (Python):
S = input()
print('YES' if 7-len(S)>=-sum([c=='o' for c in S]) else 'NO')

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

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

Solution (Python):
import sys
S = input()
cnt=0
for i in range(len(S)):
  if S[i] == 'x':
    cnt += 1
  if cnt >= 8:
    print('NO')
    sys.exit()
print('YES')

Solution (Python):
s = input()

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

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

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

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

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

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

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

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

Solution (Python):
S=input();print("YNEOS"[S.count("o")<len(S)-7::2])

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

Solution (Python):
S = list(input())
if(15-S.count('x')>=8):
    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
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

S = s()

for i in S:
    if i == "o":
        cnt += 1

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

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

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

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

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

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

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

Solution (Python):
s = input()

n = len(s)

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

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

Solution (Python):


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    S=input()
    N=len(S)
    ans=15-N+S.count("o")
    if ans>=8:
        print("YES")
    else:
        print("NO")

main()

Solution (Python):
s=input();print("YNEOS"[s.count("o")+15-len(s)<8::2])

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

if __name__ == "__main__":
    solve()

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

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

Solution (Python):
def possible(s):
  return 8 - s.count('o') <= 15 - len(s)

s = input()
if possible(s):
  print("YES")
else:
  print("NO")

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7


S = input()

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7


S = input()

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

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

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

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

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

Solution (Python):
import math
import sys
S=input()
count=0
for i in range(len(S)):
    if S[i]=="o":
        count+=1
    if count>=8:
        print("YES")
        sys.exit()
if len(S)<15:
    count+=15-len(S)
    if count>=8:
        print("YES")
        sys.exit()
print("NO")

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

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

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

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

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

if o >= 8:
    print('YES')
else:
    i = 15 - i
    if 8 - o <= i:
        print('YES')
    else:
        print('NO')

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()


def DD(arg): return defaultdict(arg)



def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count




S = S()

if Counter(S)["x"] >= 8:
  print("NO")
else:
  print("YES")

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

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

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    s = input().rstrip()
    k = len(s)
    win = s.count("o")
    print("YES" if 15 - k >= 8 - win else "NO")


if __name__ == '__main__':
    resolve()

Solution (Python):
s=input()

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

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

Solution (Python):
s=input()
k=len(s)
import collections
c = collections.Counter(s)
win = c["o"]

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

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

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

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

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

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

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

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

lst1 = ["o"]*15
s = readline().rstrip().decode('utf-8')
for i in range(len(s)):
    lst1[i] = s[i]

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

resolve()

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    s=str(input())
    l=len(s)
    val=s.count('o')
    if val+15-l>=8:
        print('YES')
    else: print('NO')
    
resolve()

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

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    S = input().rstrip()

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

    print(ans)


if __name__ == "__main__":
    main()

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

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

Solution (Python):
s = input() 

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

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

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

Solution (Python):
s = input()

c = 0
for t in s:
    if(t == 'o'):c+=1

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

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

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

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

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

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

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

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

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

if __name__ == '__main__':
    main()

Solution (Python):
S = input()
if S.count('o')+(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):


if False:
    N,K=map(int,input().split())
    print(N-K+1)



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

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
from collections import Counter
def main():
    s=input()
    s_len=len(s)
    c_s=Counter(s)
    if c_s['o']+(15-s_len)>=8:
        print("YES")
    else:print("NO")

if __name__=='__main__':
    main()

Solution (Python):
from sys import stdin
S = stdin.readline().rstrip()
ans = 0
for s in S:
    if s == 'o':
        ans += 1
if ans + (15-len(S)) >= 8:
    print('YES')
else:
    print('NO')

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

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

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

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

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

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

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

Solution (Python):
s=input()
l=[x=="o" for x in s]
print("YES" if 15-len(s)+sum(l)>7 else "NO")

Solution (Python):
s = input()

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

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

Solution (Python):
S = input()
win = 0
for c in S:
    if c == 'o':
        win += 1

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import defaultdict
from bisect import *
mod = 10**9+7

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

Solution (Python):
S = input()

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

Solution (Python):
s = input()

if s.count('x') <= 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):

from sys import setrecursionlimit
setrecursionlimit(10**6)
from collections import Counter
def inputlist(): return [int(i) for i in input().split()]


S = list(input())
c = Counter(S)
if 0<=c['x']<=7:
    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()
x = S.count('x')
if x>=8:
  ans ='NO'
else:
  ans ='YES'


print(ans)

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

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

Solution (Python):

s = input()
i = 0
win = 0
lose = 0

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

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

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

Solution (Python):
def main():
    grade = input()
    count_win = 0
    for g in grade:
        if g == "o":
            count_win += 1
    print("YES" if count_win + 15 - len(grade) >= 8 else "NO")


if __name__ == '__main__':
    main()

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

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

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

nokori = 15 - N

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

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

nokori = 15 - N
nece = 8 - nokori  

if S.count('o') >= nece:
    print('YES')
else:
    print('NO')

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

Solution (Python):



S = input()


win_num = 0
rest_num = 15 - len(S)


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

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

Solution (Python):
def main():
    s = input().rstrip()
    cnt = 0
    for c in s:
        if c == "o":
            cnt += 1
    if cnt + (15-len(s)) >= 8:
        print("YES")
    else:
        print("NO")

if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
s = str(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=str(input())
ans="YES"
if s.count("x")>7:
    ans="NO"
print(ans)

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

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

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

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


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

    main(s)

Solution (Python):
s = input()

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

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