'''
自宅用PCでの解答
'''
import math
#import numpy as np
import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
mod = 10**9+7
alp = "abcdefghijklmnopqrstuvwxyz"

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

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

    return None

if __name__ == '__main__':
    main() '''
自宅用PCでの解答
''' import math math import itertools itertools import queue queue import bisect bisect from collections import deque,defaultdict import heapq as hpq heapq from sys import stdin,setrecursionlimit ipt = stdin.readline ipt stdin.readline stdin readline setrecursionlimit(10**7) setrecursionlimit 10**7 10 7 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 alp = "abcdefghijklmnopqrstuvwxyz" alp "abcdefghijklmnopqrstuvwxyz" def main():
    s = input()
    n = len(s)
    nm = 0
    for i in s:
        if i == "o":
            nm += 1

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

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

     i s if i == "o":
            nm += 1

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

     nm >= 8-(15-n) nm 8-(15-n) 8 15-n 15 n print("YES") print "YES" print("NO") print "NO" return None None if __name__ == '__main__':
    main() __name__ == '__main__' __name__ '__main__' main() main ipt = stdin.readline stdin.readline ipt alp = "abcdefghijklmnopqrstuvwxyz" "abcdefghijklmnopqrstuvwxyz" alp def main():
    s = input()
    n = len(s)
    nm = 0
    for i in s:
        if i == "o":
            nm += 1

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

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

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

    return None main mod = 10**9+7 10**9+7 mod
'''
自宅用PCでの解答
'''
import math
#import numpy as np
import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
mod = 10**9+7
alp = "abcdefghijklmnopqrstuvwxyz"

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

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

    return None

if __name__ == '__main__':
    main()
