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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
from __future__ import print_function
# import numpy as np
# import numpypy as np
import sys
input = sys.stdin.readline

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

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

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

import re
import array
import copy
import functools
import operator

import collections
import itertools
import bisect
import heapq


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

from queue import PriorityQueue as pq

# from itertools import accumulate
# from collections import deque
import random


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

yes=0
no=0

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

Submission status: Accepted

Solution code:
import numpy as np

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

print(Answer)

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# m-solutions2019/m_solutions2019_b
import sys

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

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

s = list(s)

win_number = s.count('o')

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s=input()

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

    print("YES")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import math
import itertools


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


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

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





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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
s = input()
lost = 0
k = len(s)
for c in s:
    if c == 'x':
        lost += 1
if lost >=8:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

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



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

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

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


sum=0
for i in range(N):
  if S[i]=="o":
    sum=sum+1
  
if sum+15-N>7:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

if win + remain_match >= 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 < 8:
	print("YES")
else:
	print("NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = raw_input()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

import sys

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#coding:utf-8
chars = input()
cnt = 0
for char in chars:
    if char == 'o':
        cnt += 1
if (cnt + 15 - len(chars)) >=  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()
print("YES" if (15 - len(S)) + S.count("o") >= 8 else "NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = S.count('x')

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

Submission status: Accepted

Solution code:
S = input()
S.split(',')
#print(S)
lenS = len(S)
maru = 0
#print(lenS,maru)
for i in range(lenS):
    if S[i] == 'o':
        maru += 1
    else:
        maru = maru
if 15-lenS + maru >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s = input()

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

if kati + nokori >= 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):
    if(15-len(S)+S.count('o') >= 8) :
        print(YES)
    else:
        print(NO)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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()
f = 0
for i in range(len(S)):
 if S[i] == "o":
  f += 1
if 15 - len(S) + f >= 8:
 print("YES")
else:
 print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

import math

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

S = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

S = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
cnt = 0
for i in S:
    if i == 'x':
        cnt += 1
if cnt < 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

win = 0
lose = 0

for i in S:
  if (i == 'o'):
    win += 1
  else:
    lose += 1
  
if (lose >= 8):
  print('NO')
else:
  print('YES')

Submission status: Accepted

Solution code:
s = str(input())

ok = s.count('o')
ng = s.count('x')
n = len(s)
rest = 15 - n

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    S = str(input())
    k = len(S)

    S_list = []

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

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

Submission status: Accepted

Solution code:
s = list(input())

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


print(ans)

Submission status: Accepted

Solution code:
S=input()
cnt = S.count('o')
k = len(S)
if cnt+15-k >= 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:
import sys,heapq
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
def ddprint(x):
  if DBG:
    print(x)

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

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = list(input())#stinrg
N = len(s)

kati = 0
for i in s:
	if i == "o":
		kati += 1

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

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

t = read()
count = 0
l = 0
for i in list(t):
    if i == 'o':
        count += 1
    l += 1
for i in range(15 - l - 1):
    count += 1
if count >= 7:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s = input()
s = list(s)
count = 0
for i in range(len(s)):
    if s[i] == "o":
        count = count + 1
if count + (15-len(s)) >= 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:
#!/usr/bin/env python
# coding: utf-8

# In[ ]:


import sys
#input = sys.stdin.readline
#A, B = map(int, input().split())
S = input()
a = 15-len(S)+(S.count('o'))
if a >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
from collections import Counter
S = input()
s = Counter(S)

print("NO" if s["x"] >= 8 else "YES")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def solve(): 
    S = input()
    if S.count('o')+(15-len(S)) >= 8:
        res = 'YES'
    else:
        res = 'NO'
    return str(res)

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

Submission status: Accepted

Solution code:
S = input()
cnt = 0

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

    else:
        cnt += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# n=int(input())
# a,b=map(int, input().split())
# c=list(map(int, input().split()))
# s=[list(map(int,list(input()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

# a=100
# b=0.987654321
# print('{0:06d}-{1:6f}'.format(a,b))  # 0埋めのときの出力
# 000100-0.987654

import numpy as np
import math
import copy

s = list(input())

cnt = 0

for elem in s:
    if elem == 'o':
        cnt += 1
    if cnt == 8:
        print('YES')
        exit()

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

Submission status: Accepted

Solution code:
s = input()
n = len(s)
sum = 0
for i in range(n):
    if(s[i]=='x'):
        sum+=1
if(sum > 7):
    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()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import deque
from operator import itemgetter

input = sys.stdin.readline

S = input()
A = S.count("o")
B = S.count("x")

if B > 7:
    print('NO')
else:
    print("YES")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#JMD
#Nagendra Jha-4096

 
import sys
import math

#import fractions
#import numpy
 
###File Operations###
fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile

###Defines...###
mod=1000000007
 
###FUF's...###
def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 
##### Main ####
t=1
for tt in range(t):
    s=str(input())
    v=s.count('o')
    v+=15-len(s)
    if(v<8):
        print("NO")
    else:
        print("YES")
    #n,k,s= map(int, sys.stdin.readline().split(' '))
    #a=list(map(int,sys.stdin.readline().split(' ')))
    
    
#####File Operations#####
if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s=str(input())
l=len(s)

k=0
for i in range(l):
    if s[i]=="o":
        k=k+1
if l-k<=7:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import sys
range = xrange
input = raw_input

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

if 8 - s <= 15 - k:
    print 'YES'
else:
    print 'NO'

Submission status: Accepted

Solution code:
s = list(input())
#wcnt = s.count('o')
lcnt = s.count('x')

#print(len(s))
#print(wcnt, lcnt)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input();print("NYOE S"[15 - S.count("x") > 7::2])

Submission status: Accepted

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

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())
k=len(s)
con=0
for i in s:
    if i =="x":
        con+=1

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

Submission status: Accepted

Solution code:
#coding:utf-8

S = input()

k = len(S)
nokori = 15 - k

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
S=(stdin.readline().rstrip())
S = list(S)
for i in range((15-len(S))):
    S.append("o")
if S.count("o") >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

Solution code:
S = input()

cnt_win = S.count('o')
ans = cnt_win + (15 - len(S))

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

Submission status: Accepted

Solution code:
s=list(input())
c=0
cc=0
for i in s:
    if i=="o":
        c+=1
    if i=="x":
        cc+=1

if c>=8 or cc<=7:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
w = S.count('o')
l = S.count('x')
m = len(S)

n = 15 - m

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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