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



Sample input:
oxoxoxoxoxoxox


Sample output:
YES

Submission status: Accepted

Solution code:
s=str(input())
ans="YES"
if s.count("x")>7:
    ans="NO"
print(ans)

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

    main(s)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input()
victory = s.count("o")
if 15 - len(s) + victory >= 8: print("YES")
else: print("NO")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

S = input()

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

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

res = 15 - k

must = 8 - res

win = s.count("o")

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
# import sys
matches = input()
matches_list = list(matches)
# o = 0
x = 0
for i in matches_list:
  # if i == 'o':
  #   o += 1
  if i == 'x':
    x += 1

if x >= 8:
  print('NO')
else:
  print('YES')
  # sys.exit()

# print(x, matches_list)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#M-SOLUTIONS プロコンオープン B

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#23 M-SOLUTIONS
s=input()
x=s.count("x")
print("YES" if x<=7 else "NO")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys
import copy

sys.setrecursionlimit(1000000)

# input = sys.stdin.readline

# ~~~~~~~~~~~~~~~~~~~~~_(＾～＾ ｣ ∠)_~~~~~~~~~~~~~~~~~~~~~

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
S = input()

t = S.count("x")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
# MERGE IT


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

# LOSE IT

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#k回対戦済

S = input()

#リストに変換
S_list = []
for i in range(0,len(S)):
    S_list.append(S[i])
#print(S_list)

#勝ち数
Nvic = S_list.count("o")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
s = sys.stdin.readline().rstrip()
if len([y for y in s if y == 'x']) >= 8:
  print('NO')
else:
  print('YES')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()

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

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
km = input()

#k = km.count('o')
m = km.count('x')

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#-*- coding: utf-8
#  -*-
"""
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):
    # oxoxoxoxoxoxox
    c = 0
    for s in S:
        if s == 'o': c+=1
    return 'YES' if 15 - len(S) + c >= 8 else 'NO'


do_submit = True
#do_submit = False

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)
    #n = int(parsed_lines[0][0])
    S = parsed_lines[0][0]
    # k = int(parsed_lines[0][1])
    # S = parsed_lines[1][0]
    # return n, k, S
    return S


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

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

else:
    # n, k = list(map(int, input().split()))
    # S = input().split()
    # print(sol(n, k, S))
    S = input().strip()
    # S = input().strip()
    print(sol(S))

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

#oが勝ち、xが負け
S = input()
le = len(S)

#勝ち数
win = (S.count('o'))

#残試合数
zan = 15 - le

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
S=input()

total = len(S)
zan = 15 - total

win = S.count('o')
# lose = S.count('x')

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

Submission status: Accepted

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