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:
#input
a = str(input())

x = 0
for s in a:
  if s == "x":
    x += 1


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

Submission status: Accepted

Solution code:
s = str(input())

win = 0
for i in s:
    if(i == "o"):
        win += 1
        
win += 15- len(s)

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

Submission status: Accepted

Solution code:
data = input().split()
a = data[0]

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

Submission status: Accepted

Solution code:
#B
S = input()
count=0
for i in S:
    # print(i)
    if i == 'x':
        count+=1

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

Submission status: Accepted

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

ans = cnt + 15 - len(S)

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

Submission status: Accepted

Solution code:
S = input()
print('YES' if sum([1 for ch in S if ch == 'o']) + 15 - len(S) >= 8 else 'NO')

Submission status: Accepted

Solution code:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
S = list(input())
if S.count('x') <= 7:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=raw_input()
t=0
for x in S:
	if x=="o":  t+=1
print "YES" if  8 <= t+(15-len(S))  else "NO"

Submission status: Accepted

Solution code:
b = input()
win = b.count('o')
l = len(b)


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

Submission status: Accepted

Solution code:
S = str(input())

win = 0
lose = 0
for _ in S:
    if _ == 'o':
        win += 1
    if _ == 'x':
        lose += 1
    
if 15 - lose < 8:
    print('NO')
else:
    print('YES')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

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

Submission status: Accepted

Solution code:
S = input()
counter = 0
for i in range(len(S)):
    if S[i] == 'x':
        counter += 1

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

Submission status: Accepted

Solution code:
import atexit
import io
import sys

buff = io.BytesIO()
sys.stdout = buff


@atexit.register
def write():
    sys.__stdout__.write(buff.getvalue())


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

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [S] = [(input_raw[0])]
    count_x= 0
    for s in S:
        if s == "x":
            count_x += 1
    if count_x >= 8:
        print "NO"
    else:
        print "YES"


if __name__ == '__main__':
    main()

Submission status: Accepted

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

num_win = s.count('o')

num_rest = 15 - len(s)

if num_win + num_rest > 7:
    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 = str(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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if [i for i in input()].count('x') >= 8:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
s=str(input())
cou = 0
for i in range(len(s)):
    if s[i] == "x":
        cou +=1

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

Submission status: Accepted

Solution code:
s = input()
while len(s) < 15:
    s += 'o'

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

Submission status: Accepted

Solution code:
s = input()
lst = list(s)
if lst.count("x")>7:
  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 = str(input())
kati = 0
for i in range(len(S)):
    if S[i] == "o":
        kati += 1

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

Submission status: Accepted

Solution code:
S = input()

k = len(S)
vic = S.count('o')

if 7 < (vic + (15-k)):
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
s = input()
d = len(s)
n = s.count('o')
print('YES' if d-n<=7 else 'NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

WIN = 'o'
LOSE = 'x'

wins = 0
for s in S:
    if s == WIN:
        wins += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=input()
a=0
for i in x:
  if i=='x':
    a+=1
print(["NO","YES"][a<=7])

Submission status: Accepted

Solution code:
s = input()
left = 15 - len(s)
win = 0
for i in range(len(s)):
    if s[i] == "o": win += 1
if win + left >= 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:
S = input()
count = 0

for s in S :
    if s == "o" :
        count += 1



if count >= len(S) - 7 :
    print('YES')
else :
    print('NO')

Submission status: Accepted

Solution code:
S = input()

for i in range(15-len(S)):
    S += 'o'

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

Submission status: Accepted

Solution code:
ans="NO"
S=input()

count=0
for i in range(len(S)):
    if S[i]=="o":
        count+=1
if (15-len(S)+count)>=8:
    ans="YES"

print(ans)

Submission status: Accepted

Solution code:

S=input()

count=0

for i in S:
    if i=="x":
        count+=1
        
if count<8:
    print('YES')
else:
    print("NO")

Submission status: Accepted

Solution code:
S = input()

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

cnt += 15 - l

if cnt > 7:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
lis = list(input())
batu = 0
for item in lis:
  if item == "x":
    batu += 1
if batu >= 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:
lst = list(input())
x = lst.count('x')
o = lst.count('o')
if 15 - x >= 8:
	print('YES')
else:
	print('NO')

Submission status: Accepted

Solution code:
# coding: utf-8
import os
import time
import re
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input()
print(['NO', 'YES'][s.count('x') <= 7])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

n = len(S)
m = S.count('o')

if 15-n+m >= 8:
    print('YES')

if 15-n+m < 8:
    print('NO')

Submission status: Accepted

Solution code:
def f(S):
    return S.count('o') + (15 - len(S)) >= 8


S = input()
print('YES' if f(S) else 'NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
if 15 - len(s) + s.count("o") < 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()
res=0
k=len(s)
for i in range(k):
    if s[i]=='o':
        res+=1
    else:
        continue
p=15-k
if p+res>=8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

Solution code:
import numpy as np
import math

def main():
    S = input()
    num = 0
    for s in S:
        if s == "x":
            num += 1
    if num > 7:
        print("NO")
    else:
        print("YES")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()


w = 0
l = 0
for s in S:
    if s == 'o':
        w+=1
    else:
        l+=1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

print("YES" if ans>7 else "NO")

Submission status: Accepted

Solution code:
s=str(input())

batu=s.count("x")
maru=s.count("o")
leng=len(s)

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

Submission status: Accepted

Solution code:
n = str(input())
c = 0
for i in range(len(n)):
    if n[i] == "x":
        c += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
"""<https://github.com/cheran-senthil/PyRival>"""
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
else:
    _str = str
    str = lambda x=b"": x if type(x) is bytes else _str(x).encode()


def main():
    s = read()
    lost = s.count('x')
    print("YES" if lost < 8 else "NO")


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        if self.buffer.tell():
            return self.buffer.read()
        return os.read(self._fd, os.fstat(self._fd).st_size)

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", b" "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", b"\n"))
    if kwargs.pop("flush", False):
        file.flush()


sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
input = lambda: sys.stdin.readline().rstrip(b"\r\n")


def read():
    return input()


def read_array(sep=None, maxsplit=-1):
    return read().split(sep, maxsplit)


def read_int():
    return int(read())


def read_int_array(sep=None, maxsplit=-1):
    return [int(a) for a in read_array(sep, maxsplit)]

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
cou = 0
for i in S:
    if i == "x":
        cou += 1

if cou <= 7:
    print("YES")
elif cou >= 8:
    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()
o = 0
x = 0
for s in S:
    if s =="o":
        o += 1
    else:
        x += 1
if 15 - len(S) + o >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5)


def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()

S = SI()
k = len(S)
count = 15-k
for s in S:
    if s=="o":
        count+=1

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

Submission status: Accepted

Solution code:
S=list(input())
nagasa=len(S)
c=0
for n in range(nagasa):
    if S[n]=='o':
        c=c+1
if c>=nagasa-7:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit

import heapq as hq
import itertools as its
import operator as op


# globals
inf = float('inf')
N = 0


def set_inputs():
    global N
    return


def main():
    setrecursionlimit(100000)
    set_inputs()
    # ----------MAIN----------
    s = get_str()
    if 15 - len(s) + s.count("o") >= 8:
        print('YES')
    else:
        print('NO')
    return


def get_int():
    return int(input())


def get_float():
    return float(input())


def get_str():
    return input().strip()


def get_li():
    return [int(i) for i in input().split()]


def get_lf():
    return [float(f) for f in input().split()]


def get_lc():
    return list(input().strip())


def get_data(n, types, sep=None):
    if len(types) == 1:
        return [types[0](input().strip()) for _ in range(n)]
    return list(zip(*(
        [t(x) for t, x in zip(types, input().strip().split(sep=sep))]
        for _ in range(n)
    )))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools as it
import collections as col
import heapq
import sys
sys.setrecursionlimit(10**9)

"""N=(input())
print(180*N)
"""
S=list(input())
T=[c for c in S if c == 'o']
print("YES" if len(T) + (15 - len(S)) >= 8 else "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=list(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 range(len(s)):
    if s[i] =='o':
        count += 1

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000


S = str(input())
win = 0
for i in range(len(S)):
    if S[i] == "o":
        win += 1


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

Submission status: Accepted

Solution code:
S = input()

lose = 0
for i in S:
    if i == 'x':
        lose += 1

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

Submission status: Accepted

Solution code:
S = input()
c = 0
t = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

a = S.count('o')
l = len(S)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
n = len(s)
ans = 0
for i in range(n):
    if s[i] =="x":
        ans += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline

S = readline().rstrip()

k = len(S)

wins = S.count('o')

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
S_lis = list(S)

count = 0
S_len = 15 - len(S_lis)
for i in S_lis:
  if i == "o":
    count += 1

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "YES"  # type: str
NO = "NO"  # type: str

def solve(S: str):
    cnt = 0
    for c in S:
        if c == 'o':
            cnt += 1
    n = len(S)
    if cnt + (15 - n) > 7:
        ret = YES
    else:
        ret = NO
    print(ret)
    return


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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
lose = 0

for i in S:
    if i == "x":
        lose += 1

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

else:
    print ("YES")

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=list(input())
n=len(s)
cnt=0
for i in range(n):
  if s[i]=="x":
    cnt+=1

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

Submission status: Accepted

Solution code:
M = 15
T = 8


def main():
    win_table = [c == "o" for c in input()]
    k = len(win_table)
    num_win = sum(win_table) + (M - k)
    if num_win >= T:
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

win = 0
lose = 0

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

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

Submission status: Accepted

Solution code:
S = input()
ans = True
cnt = 0
for i in S:
    if i == "x":
        cnt += 1
    if cnt >= 8:
        ans = False
        break
        
if ans:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
import sys
from operator import itemgetter

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    S = input().strip()
    k = len(S)
    win = 0
    for c in S:
        if c == 'o':
            win += 1

    if win + (15 - k) >= 8:
        return 'YES'
    else:
        return 'NO'


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
o_count = S.count('o')
x_count = S.count('x')

if o_count >= 8:
    print('YES')
elif o_count + (15-len(S)) >= 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()
win = 0
for s in S:
	if s == "o":
		win += 1
if 15-len(S)+win >= 8:
	print('YES')
else:
	print('NO')

Submission status: Accepted

Solution code:
s=input()
cnt=0
for i in s:
  if i=="x":
    cnt+=1
if cnt>7:
  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:
S = input()

rest = 15 - len(S)

win = S.count('o')

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop, heapify, heapreplace

class Solution:
    def main(self):
        S = input()
        cnt = S.count('x')

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


if __name__ == '__main__':
    Solution().main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
O = 0
X = 0

for i in range(len(S)):
    if S[i]=="o":
        O += 1
    elif S[i]=="x":
        X += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
tmp = 0
# oxoxoxoxoxoxox
for i in n:
    if i == "o":
        tmp += 1
if tmp + 15 - len(n) >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
#!/usr/bin/env python
S = input()
c = S.count('x')
if c >= 8:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
make=0
kati=0
nagasa=len(s)
for i in range(nagasa):
    if s[i]=='o':
        kati+=1
    if s[i]=='x':
        make+=1

#print(kati,make)

if make<8:
    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:
import sys
INPUT = sys.stdin.readline

def SINGLE_INT(): return int(INPUT())
def MULTIPLE_INT_LIST(): return list(map(int, INPUT().split()))
def MULTIPLE_INT_MAP(): return map(int, INPUT().split())
def SINGLE_STRING(): return INPUT()
def MULTIPLE_STRING(): return INPUT().split()

S = SINGLE_STRING()
counter = 15

for c in S:
    if c == 'x':
        counter -= 1

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

Submission status: Accepted

Solution code:
S = input()

lose = S.count("x")

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

Submission status: Accepted

Solution code:
l = raw_input().split()
S = l[0]
#print(S)
wins = S.count('o')
remains = 15 - len(S)
if remains + wins >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:

s = input()

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

Submission status: Accepted

Solution code:
S = list(input())

least = 15 - len(S)
sumv = least
for i in S:
    if i == "o":
        sumv += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

l = len(s)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# M-sol B
# input
a = input()
if a.count('x') > 7:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
s=input()
s=list(s)
w=0

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

if w+(15-len(s))>7:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
from collections import Counter
s = list(input())
l = len(s)
a = s.count('o')
if 8-a <= 15-l:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
def read():
    S = input().strip()
    return S,


def solve(S):
    n_lose = 0
    for s in S:
        if s == 'x':
            n_lose += 1
    if n_lose >= 8:
        return 'NO'
    else:
        return 'YES'


if __name__ == '__main__':
    inputs = read()
    print("%s" % solve(*inputs))

Submission status: Accepted

Solution code:
s = input()

count = 0

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

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = list(input().split()[0])

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

Submission status: Accepted

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