A large banner with word CODEFORCES was ordered for the 1000-th onsite round of Codeforces^{ω} that takes place on the Miami beach. Unfortunately, the company that made the banner mixed up two orders and delivered somebody else's banner that contains someone else's word. The word on the banner consists only of upper-case English letters.

There is very little time to correct the mistake. All that we can manage to do is to cut out some substring from the banner, i.e. several consecutive letters. After that all the resulting parts of the banner will be glued into a single piece (if the beginning or the end of the original banner was cut out, only one part remains); it is not allowed change the relative order of parts of the banner (i.e. after a substring is cut, several first and last letters are left, it is allowed only to glue the last letters to the right of the first letters). Thus, for example, for example, you can cut a substring out from string 'TEMPLATE' and get string 'TEMPLE' (if you cut out string AT), 'PLATE' (if you cut out TEM), 'T' (if you cut out EMPLATE), etc.

Help the organizers of the round determine whether it is possible to cut out of the banner some substring in such a way that the remaining parts formed word CODEFORCES.


-----Input-----

The single line of the input contains the word written on the banner. The word only consists of upper-case English letters. The word is non-empty and its length doesn't exceed 100 characters. It is guaranteed that the word isn't word CODEFORCES.


-----Output-----

Print 'YES', if there exists a way to cut out the substring, and 'NO' otherwise (without the quotes).


-----Examples-----
Input
CODEWAITFORITFORCES

Output
YES

Input
BOTTOMCODER

Output
NO

Input
DECODEFORCES

Output
YES

Input
DOGEFORCES

Output
NO

Difficulty: interview

Starter code:

Solutions:
import sys

fin = sys.stdin
fout = sys.stdout

#fin = open("input.txt", 'r')
#fout = open("output.txt", 'w')

s = fin.readline().strip()
n = len(s)
for L in range(n):
    for R in range(L + 1, n + 1):
        s1 = s[:L]
        s2 = s[L:R]
        s3 = s[R:]
        if (s1 + s3 == "CODEFORCES"):
            print("YES")
            return
print("NO")


s = input()
ss = "CODEFORCES"
ans = "NO"
for i in range(len(s)):
    for j in range(i, len(s)):
        h = s[0:i] + s[j + 1:]
        if (h == ss):
            ans = "YES"
print(ans)


s = input()

if s.startswith('CODEFORCES'):
    print('YES')
    return

for i in range(len(s)):
    for j in range(i):
        if s[:j] + s[i:] == 'CODEFORCES':
            print("YES")
            return

print("NO")


3
# -*- coding: utf8 -*-

def main():
    s = input()
    c = 'CODEFORCES'
    for i in range(len(c) + 1):
        if s.startswith(c[:i]) and s.endswith(c[i:]):
            print('YES')
            return
    print('NO')

def __starting_point():
    main()

__starting_point()

a = input()
if a.startswith("CODEFORCES") or a.endswith("CODEFORCES"):
    print("YES")
    return
for i in range(len(a)):
    for j in range(i,len(a)):
        if a[:i]+a[j+1:]=="CODEFORCES":
            print("YES")
            return
print("NO")

def __starting_point():
    word = input()
    if word.startswith("CODEFORCES"):
        print("YES")
    elif word.startswith("CODEFORCE") and word.endswith("S"):
        print("YES")
    elif word.startswith("CODEFORC") and word.endswith("ES"):
        print("YES")
    elif word.startswith("CODEFOR") and word.endswith("CES"):
        print("YES")
    elif word.startswith("CODEFO") and word.endswith("RCES"):
        print("YES")
    elif word.startswith("CODEF") and word.endswith("ORCES"):
        print("YES")
    elif word.startswith("CODE") and word.endswith("FORCES"):
        print("YES")
    elif word.startswith("COD") and word.endswith("EFORCES"):
        print("YES")
    elif word.startswith("CO") and word.endswith("DEFORCES"):
        print("YES")
    elif word.startswith("C") and word.endswith("ODEFORCES"):
        print("YES")
    elif word.endswith("CODEFORCES"):
        print("YES")
    else:
        print("NO")

__starting_point()

s = input()

f = False;

for i in range(1, len(s)):
    if f:
        break;
    for j in range(0, len(s) - i + 1):
        t = s[0:j] + s[j+i:]
        if t == "CODEFORCES":
            print("YES")
            f = True
            break
        
if not f:
    print("NO")
            

        
        


import sys
f = sys.stdin

s = f.readline().strip()
SS = 'CODEFORCES'

res = False
        
for i in range(len(s)):
    for l in range(len(s)):
        if s[:i] + s[(i+l):] == SS:
            res = True
            break


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

        
        



l = list(input())
l1 = list('CODEFORCES')
c = 0
d = 0
for i in range(min(len(l),len(l1))):
    if l[i] == l1[i]:
        c += 1
    else:
        break

l = l[::-1]; l1 = l1[::-1]
for i in range(min(len(l),len(l1))):
    if l[i] == l1[i]:
        d += 1
    else:
        break
if c+d >= len(l1):
    print('YES')
else:
    print("NO")


s = input()
s2 = "CODEFORCES"
while s and s2 and s[0] == s2[0]:
    s = s[1:]
    s2 = s2[1:]
while s and s2 and s[-1] == s2[-1]:
    s = s[:-1]
    s2 = s2[:-1]
if s2 == '':
    print("YES")
else:
    print("NO")


import re
s = input().strip()
for i in range(0, len(s)):
	for j in range(i+1, len(s)+1):
		if s[:i] + s[j:] == 'CODEFORCES':
			print('YES')
			raise SystemExit
print('NO')


def solve(s,n,w):
    if s==w:
        return "YES"
    for i in range(n):
        for j in range(i,n,1):
            ns=s[0:i]+s[j+1:]
            if len(ns) != len(w):
                continue
            for k in range(len(ns)):
                if ns[k] != w[k]:
                    break
            else:
                return "YES"
    return "NO"

s=input()
n=len(s)
w="CODEFORCES"
print(solve(s,n,w))


S = input()
c = 'CODEFORCES'
for i in range(len(S)):
    for j in range(i, len(S)+1):
        if S[:i] + S[j:]== c:
            print('YES')
            return
print('NO')
        
    


def solve(word):
    banner = "CODEFORCES"

    for c in word:
        if c == banner[0]:
            banner = banner[1:]
            if len(banner) == 0:
                return True
        else:
            break

    for c in word[::-1]:
        if c == banner[-1]:
            banner = banner[:-1]
            if len(banner) == 0:
                return True
        else:
            break
    return False

import sys
word = sys.stdin.read().strip()
if solve(word) == True:
    print("YES")
else:
    print("NO")

x = input()
if len(x) < 10:
    print("NO")
else:
    if ((x[0:1] == "C") and (x[len(x) - 9:len(x)] == "ODEFORCES")) or ((x[0:2] == "CO") and (x[len(x) - 8:len(x)] == "DEFORCES")) or ((x[0:3] == "COD") and (x[len(x) - 7:len(x)] == "EFORCES")) or ((x[0:4] == "CODE") and (x[len(x) - 6:len(x)] == "FORCES")) or ((x[0:5] == "CODEF") and (x[len(x) - 5:len(x)] == "ORCES")) or ((x[0:6] == "CODEFO") and (x[len(x) - 4:len(x)] == "RCES")) or ((x[0:7] == "CODEFOR") and (x[len(x) - 3:len(x)] == "CES")) or ((x[0:8] == "CODEFORC") and (x[len(x) - 2:len(x)] == "ES")) or ((x[0:9] == "CODEFORCE") and (x[len(x) - 1:len(x)] == "S")) or ((x[0:10] == "CODEFORCES") or (x[len(x) - 10:len(x)] == "CODEFORCES")):
        print("YES")
    else:
        print("NO")

s = input()
ans = False
n = len(s)
for i in range(n):
    for j in range(i + 1, n):
        if s[:i] + s[j:] == 'CODEFORCES':
            ans = True
            break
    if ans:
        break
if s[:10] == 'CODEFORCES':
    ans = True

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

def main(s):
    key = "CODEFORCES"
    for i in range(11):
        s1 = key[0:i]
        s2 = key[i:10]
        if s.startswith(s1) and s.endswith(s2):
            return 'YES'
    return 'NO'

def __starting_point():
    s = input()
    print(main(s))

__starting_point()

from fnmatch import fnmatch, fnmatchcase
pat  =["*CODEFORCES", "C*ODEFORCES", "CO*DEFORCES"
,"COD*EFORCES"
,"CODE*FORCES"
,"CODEF*ORCES"
,"CODEFO*RCES"
,"CODEFOR*CES"
,"CODEFORC*ES"
,"CODEFORCE*S"
,"CODEFORCES*"]
name = input()
ok = 0
for s in pat:
    if fnmatch(name,s):
        print("YES")
        ok = 1
        break
if ok == 0:
    print("NO")


s, t = 'CODEFORCES', input().strip()
print('YES' if any(s[:i] == t[:i] and s[i:] == t[len(t) - len(s) + i:] for i in range(len(s) + 1)) else 'NO')


t = 'CODEFORCES'

s = input()

for i in range(len(s)):
    for j in range(i, len(s) + 1):
        if ''.join((s[:i], s[j:])) == t:
            print('YES')
            return
print('NO')


3

s = "CODEFORCES"

inp = input()

ans = False

for i in range(len(inp)):
    for j in range(i, len(inp) + 1):
        new_s = inp[:i] + inp[j:]
        if new_s == s:
            ans = True

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


#!/usr/bin/env python3

s = input()
ln = len(s)
ans = "NO"
pat = "CODEFORCES"
cl = len(pat)
if ln > cl:
    for pref_len in range(cl):
        check = s[:pref_len] + s[pref_len - cl:]
        if check == pat:
            ans = "YES"
            break
    if s[:cl] == pat:
        ans = "YES"
print(ans)


def main():
    s = input()
    n = len(s)
    for i in range(n):
        for j in range(i + 1, n + 1):
            t = s[:i] + s[j:]
            if t == "CODEFORCES":
                print("YES")
                return
    print("NO")
    return

main()


            
            


x = input()
n = len(x)

for i in range(n):
  for j in range(i+1,n+1):
    if(x[:i]+x[j:]=="CODEFORCES"):
        print("YES")
        return
print("NO")
return


s = input()

n = len(s)
good = False
for i in range(n):
    for j in range(i + 1, n + 1):
        if s[:i] + s[j:] == 'CODEFORCES':
            good = True

print('YES' if good else 'NO')