Problem:
 Score : 100 points    Problem Statement This contest is CODEFESTIVAL , which can be shortened to the string CF by deleting some characters.  Mr. Takahashi, full of curiosity, wondered if he could obtain CF from other strings in the same way.  You are given a string s consisting of uppercase English letters.
Determine whether the string CF can be obtained from the string s by deleting some characters.      Constraints  2 ≤ |s| ≤ 100  All characters in s are uppercase English letters ( A - Z ).         Input The input is given from Standard Input in the following format:  s       Output Print Yes if the string CF can be obtained from the string s by deleting some characters.
Otherwise print No .        Sample Input 1 CODEFESTIVAL      Sample Output 1 Yes  CF is obtained by deleting characters other than the first character C and the fifth character F .       Sample Input 2 FESTIVALCODE      Sample Output 2 No  FC can be obtained but CF cannot be obtained because you cannot change the order of the characters.       Sample Input 3 CF      Sample Output 3 Yes  It is also possible not to delete any characters.       Sample Input 4 FCF      Sample Output 4 Yes  CF is obtained by deleting the first character.

Solution (Python):
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy

def j(q):
    if q==1: print("Yes")
    elif q == 0:print("No")
    exit(0)
rem = pow(10,9)+7
"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def printrow(a):
    for i in range(len(a)):
        print(a[i])
def combinations(n,r):
    if n<r:return 0
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def permutations(n,r):
    if n<r:return 0
    return math.factorial(n) // math.factorial(n - r)
def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)





a = input()                                  






step = 0
for i in range(len(a)):
    if step:
        if a[i] == 'F':j(1)
    else:
        if a[i] == 'C':step+=1
j(0)

Solution (Python):
S = input()
c = S.find('C')
f = S[c:].find('F')+c
if c < 0 or f < 0:
    print('No')
    exit()
print('Yes' if f-c > 0 else 'No')

Solution (Python):
def solve():
	s = input()
	for i in range(len(s)-1):
		if s[i:i+1]=='C':
			for j in range(i+1, len(s)):
				if s[j:j+1]=='F':
					print('Yes')
					return
	print('No')
	return

solve()

Solution (Python):
s = input()
flag = False
for c in s:
  if c == 'C':
    flag = True
  if c == 'F' and flag:
    print("Yes")
    exit()
print("No")

Solution (Python):
hoge=input()
f=0
for i in range(len(hoge)):
  if("C" in hoge[:i] and "F" in hoge[i:]):
    f=1
if(f):
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
if "C" in s:
	i = s.index("C")
	if "F" in s[i + 1:]:
		print("Yes")
		exit()
print("No")

Solution (Python):
s=input()
if "C" in s:
    if "F" in s[s.index("C"):]:print("Yes")
    else:print("No")
else:print("No")

Solution (Python):
s = input()
n=1000
m=0
for i in range(len(s)):
    if s[i]=="C":
        n=min(n,i)
    if s[i]=="F":
        m=max(m,i)
if n<m:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
flag = False
ans = "No"
for s in S:
    if s == "C":
        flag = True
    if s == "F" and flag == True:
        ans = "Yes"
        break
print(ans)

Solution (Python):
s = input()
flag = 0
for i in range(len(s)):
  if s[i]=="C":
    flag=1
  if s[i]=="F" and flag==1:
    flag=2
if flag>1:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
c = s.find('C')
f = len(s) - s[::-1].find('F') - 1
if c < f and c != -1 and f != len(s):
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
flag = False
flag1 = True
flag2 = False
for i in range(len(s)):
    if flag1 and s[i] == 'C':
        flag1 = False
        flag2 = True
    if flag2 and s[i] == 'F':
        flag = True
        break
if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
ans = "No"
C = False
for i in s:
    if C and i == 'F':
        ans = "Yes"
        break
    if i == 'C':
        C = True
print(ans)

Solution (Python):
s = input()
if s.count('C') == 0 or s.count('F') == 0:
    print('No')
else:
    s = s[s.find('C'):]
    if s.count('F') == 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
s= input()
a=-1
b=-1
for i in range(len(s)):
  if s[i]=='C':
    a = i
  elif s[i]=='F':
    b = i
if a>=0and a<b:
  print("Yes")
else:
  print("No")

Solution (Python):


import sys, re

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

s=input()

if re.match('.*C.*F.*', s):
    Yes()
else:
    No()

Solution (Python):
s = input()
if 'C' in s and 'F' in s:
    a = s.index('C')
    if 'F' in s[a:]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
s=input()
flag=False
id=len(s)
for i in range(len(s)):
  if s[i]=='C':
    id=i
    break;
for i in range(id,len(s)):
  if s[i]=='F':
    flag=True
if flag:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
string = ''
for i in s:
    if i == 'C' or i == 'F':
        string += i
print('Yes' if 'CF' in string else 'No')

Solution (Python):
a=input()
c,f=a.find('C'),a.rfind('F')
print("Yes" if not c==-1 and not f==-1 and c<f else "No")

Solution (Python):
s = list(input())
flg = 0
cf = 0
for i in s:
    if i == 'C':
       flg = 1
    if i == 'F' and flg == 1:
        cf = 1
if cf == 1:
    print('Yes')
else:
    print('No')

Solution (Python):
import re
if re.search("C.*F", input()):
    print("Yes")
else: 
    print("No")

Solution (Python):
s = input()
C_flag = 0
F_flag = 0
for i in range(len(s)):
  if C_flag == 0:
    if s[i] == "C":
      C_flag = 1
  else:
    if s[i] == "F":
      F_flag = 1
if C_flag == 1 and F_flag == 1:
  print("Yes")
else:
  print("No")

Solution (Python):
import re
print('Yes' if re.search(r'C.*F', input()) else 'No')

Solution (Python):
a=input()

if a.find('C')<a.rfind('F')and 'C'in a and 'F'in a:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
ans  = 0
for i in s:
    if i == 'C':
        ans = 1
    if ans == 1 and i == 'F':
        print('Yes')
        exit()

print('No')

Solution (Python):
s = list(input())
ans = ''
for i in s:
    if i in 'C':
        ans += i
    elif i in 'F':
        ans += i
print('Yes' if 'CF' in ans else 'No')

Solution (Python):
s = input()
flag = False
for i in range(len(s)):
    if s[i] == "C":
        flag = True
        break


if flag:
    flag = False
    for j in range(len(s)-1, -1, -1):
        if s[j] == "F":
            flag = True
            break

print("Yes" if (flag and i < j) else "No")

Solution (Python):
s=input()
if "C"in s and "F"in s:
  if s.find("C")<s.rfind("F"):print("Yes")
  else:print("No")
else:print("No")

Solution (Python):
import re
print('Yes') if len(re.compile(r'.*C.*F.*').findall(input()))>=1 else print('No')

Solution (Python):
S = input()
C = 105
F = -5
for i in range(len(S)):
  if S[i] == "C":
    C = i
    break
for i in range(len(S)-1,-1,-1):
  if S[i] == "F":
    F = i
    break
if C<F:
  print("Yes")
else:
  print("No")

Solution (Python):
import re;print(re.match('.*C.*F',input())and'Yes'or'No')

Solution (Python):
s=input()
if "C" in s:
    s=s[s.find("C"):]
    if "F" in s:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
S = input()

ans = ""
res = "No"
for s in S:
  if(ans == ""):
    if(s == "C"):
      ans += s
  if(ans == "C"):
    if(s == "F"):
      ans += s
  if(ans == "CF"):
    res = "Yes"
print(res)

Solution (Python):
b = 0
s = input()
for i in s:
  if i == "C":
    b = 1
  if b == 1 and i == "F":
    print("Yes")
    exit()
print("No")

Solution (Python):
import re;print('Yes'if re.match('.*C.*F',input())else'No')

Solution (Python):
import re;print('Yes'if re.match(r'.*C.*F.*',input())else'No')

Solution (Python):
s=input()
if "C"in s and "F"in s:
  if s.index("C")<s.rindex("F"):
    print("Yes")
    exit()
print("No")

Solution (Python):
s = input()

x = ""
for ch in s:
    if x == "" and ch == "C":
        x = "C"
    elif x == "C" and ch == "F":
        x = "CF"
ans = x == "CF"

print("Yes" if ans else "No")

Solution (Python):
S = input()

res = 'No'
flag = False
for i in range(len(S)):
    if S[i] == 'C':
        flag = True
    if  flag == True and S[i] == 'F':
        res = 'Yes'
        break
        
print(res)

Solution (Python):
s = input()
if "C" in s:
    idx = s.index("C")
    if "F" in s[idx+1:]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
s=input()
a=b=''
for i in s:
  if a=='':
    if i=='C':
      a=i
  else:
    if i=='F':
      b=i
      break
if a=='C' and b=='F':
  print('Yes')
else:
  print('No')

Solution (Python):
a = input()
s = 0
t = 0
for i in a:
  if i == "C":
    s=1
  if i == "F" and s==1:
    t = 1
if t == 1:
  print("Yes")
else:print("No")

Solution (Python):
ss = input()

iC = ss.find('C')
iF = ss.rfind('F')


if iC != -1 and iF != -1 and iC < iF:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
p = 0
for i in s:
    if i == "C":
        p = 1
    if i == "F" and p == 1:
        p = 2
        break
print("Yes" if p == 2 else "No")

Solution (Python):
s = str(input())
try:
    k = s.index("C")
    try:
        s.index("F",k,len(s))
        print("Yes")
    except:
        print("No")
except:
    print("No")

Solution (Python):
a=input()
c=False
f=False
for i in range(len(a)):
    if c==True:
        if a[i]=='F':
            f=True
    else:
        if a[i]=='C':
            c=True
if c==True and f==True:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
n = len(s)
ans = 'No'
if 'C' in s and 'F' in s:
 tmp1 = s.find('C')
 tmp2 = s.rfind('F')
 if tmp2 > tmp1:
  ans ='Yes'
print(ans)

Solution (Python):
s = input()
for i in range(len(s)):
    if s[i] == "C":
        for j in reversed(range(len(s))):
            if s[j] == "F":
                if i<j:
                    print("Yes")
                    exit()
print("No")

Solution (Python):
h=input()
c=0
d=0
for i in range(len(h)):
    if h[i]=="C":
        c=1
    if c==1 and h[i]=="F":
        d=1
print("No" if d!=1 else"Yes")

Solution (Python):
s=input();pd=0
for i in range(0,len(s)):
    if s[i]=='C':
        pd=1
    if s[i]=='F'and pd==1:
        print('Yes')
        pd=2
        break
if pd!=2:
    print('No')

Solution (Python):
s = input()
a = s.find('C')

if a == -1:
    print("No")
else:
    if s[a:].find('F') == -1:
        print("No")
    else: print("Yes")

Solution (Python):
S = input()
fc = False
ff = False
for s in S:
  if s == "C":
    fc = True
  if s == "F" and fc == True:
    ff = True

print("Yes" if fc == True and ff == True else "No")

Solution (Python):
string=str(input())
swich1=0
swich2=0
final_swich=0
for i in range(len(string)):
    if string[i]=='C':
        swich1=1
    elif swich1==1 and string[i]=='F':
        swich2=1
        print("Yes")
        final_swich=1
        break
if final_swich==0:
    print("No")

Solution (Python):
s = input()
a = s.find('C')
if a == -1:
    print("No")
else:
    if s[a:].find('F') == -1:
        print("No")
    else:
        print("Yes")

Solution (Python):
s=input()
a=False
for i in range(len(s)):
  if(s[i]=="C"):
    for j in range(i,len(s)):
      if(s[j]=="F"):
        a=True
print("Yes" if a else "No")

Solution (Python):

s = input()
if -1 < s.find("C") <= s.find("F",s.find("C")):
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
a="No"
for i in range(len(s)):
    for j in range(i,len(s)):
        if s[i]=="C":
            if s[j]=="F":
                a="Yes"
                break
print(a)

Solution (Python):
S = input()
if 'C' in S:
    i = S.index('C')
    if 'F' in S[i+1:]:
        print('Yes')
        exit()
print('No')

Solution (Python):
S = input()

f = -1

for i in range(len(S)):
    if S[i]=='C' and f==-1:
        f=0
    elif S[i]=='F' and f==0:
        f = 1
        
if f>0:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()

flg1 = False
for i in range(len(S)):
  if S[i] == 'C' and not flg1:
    flg1 = True
  elif flg1 and S[i] == 'F':
    print("Yes")
    exit(0)
print("No")

Solution (Python):
s = input()
c = False
f = False

for i in s:
  if i == 'C':
    c = True
  if i == 'F' and c:
    f = True
if f:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
n = len(s)
i = 0
while i < n:
  if s[i] == "C":
    break
  i += 1
while i < n:
  if s[i] == "F":
    print("Yes")
    exit()
  i += 1
print("No")

Solution (Python):
L = list(input())
if L.count("C") == 0 :
    ans = "No"
else :
    for i in range(len(L)) :
        if L[i] == "C" :
            if "F" in L[i:] :
                ans = "Yes"
            else :
                ans = "No"
            break
print(ans)

Solution (Python):
s=input()
j=0
for i in range(len(s)):
    if s[i]=="C" and j==0:
        j+=1
    if s[i]=="F" and j==1:
        j+=1
if j==2:
    print("Yes")
else:
    print("No")

Solution (Python):
import re
print("YNeos"[re.match(".*C.*F.*",input())==None::2])

Solution (Python):
s = input()

if 'C' in s:
    ind = s.index('C')
    if 'F' in s[ind:]:
        print('Yes')
        exit()
print('No')

Solution (Python):
import re
print('Yes'if re.match('.*C.*?F.*',input())else 'No')

Solution (Python):
s=input()
x=0;y=0
for i in range(len(s)):
  if s[i]=='C':
    x=i+1
    break
for j in range(len(s)):
  if s[j]=='F':
    y=j+1
if x*y!=0 and x<y:print('Yes')
else:print('No')

Solution (Python):
s = str(input())
if (("C" in s) and ("F" in s)):
    if s.index("C") < s.rindex("F"):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
s=input()
ans='No'
if 'C' in s:
    s=s[s.index('C'):]
    if 'F' in s:ans='Yes'
print(ans)

Solution (Python):


s = input()
c_flag = False
f_flag = False
for c in s:
    if c == 'C':
        c_flag = True
    elif c == 'F' and c_flag:
        f_flag = True
print('Yes' if f_flag else 'No')

Solution (Python):
def solve(s):
    (head_C, sep_C, tail_C) = s.partition('C')
    if sep_C == '':
        return 'No'
    (head_F, sep_F, tail_F) = tail_C.partition('F')
    if sep_F == '':
        return 'No'
    return 'Yes'

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

Solution (Python):
s = input()
flag = False
for i in range(len(s)):
  for j in range(i+1,len(s)):
    if (s[i] == 'C' and s[j] == 'F'):
      flag = True
      break
if flag:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
if 'C' in s and 'F' in s and s.index('C') < s.rindex('F'):
    print('Yes')
else:
    print('No')

Solution (Python):
S = list(input())
i = 0
while True:
    if i >= len(S):
        break
    if S[i] != "C" and S[i] != "F":
        del S[i]
        i -= 1
    i += 1
    
ans = -1
for i in range(1, len(S)):
    if S[i - 1] == "C" and S[i] == "F":
        print("Yes")
        ans = 1
        break
if ans == -1:
    print("No")

Solution (Python):
s = input()
if "C" in s:
    if "F" in s[s.index("C"):]:
        print("Yes")
        exit()
print("No")

Solution (Python):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())

S = input()
tmp = 0
for s in S:
	if tmp == 0 and s == 'C':
		tmp += 1
	elif tmp == 1 and s == 'F':
		print('Yes')
		sys.exit()

print('No')

Solution (Python):
s=input()
c=s.find("C")
f=s.rfind("F")
if c!=-1 and f!=-1 and c<f:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
c = 0
f = 0
for x in s:
    if x == 'C':c = 1
    if x == 'F' and c == 1:f = 1
if c==1 and f==1:
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()
print("Yes" if s.find('C')<s.rfind('F') and s.find('C')>=0 else 'No')

Solution (Python):
import re
print ['No', 'Yes'][re.match('.*C.*F.*', raw_input()) != None]

Solution (Python):
import re
print ['No', 'Yes'][re.match('.*C.*F.*', raw_input()) != None]

Solution (Python):
import re
print ['No', 'Yes'][re.match('.*C.*F.*', raw_input()) != None]

Solution (Python):
S = input()
if S.count("C") == 0 or S.count("F") == 0:
  print("No")
else:
  S = S[S.index("C"):]
  if S.count("F") > 0:
    print("Yes")
  else:
    print("No")

Solution (Python):
s = input()
if s == 'FCF':
    print('Yes')
elif 'C' in s and 'F' in s and s.index('C') < s.index('F'):
    print("Yes")
else:
    print("No")

Solution (Python):

s = list(input())

r = 'No'
a = []
for i in s:
    if i == 'C' or i == 'F':
        a.append(i)
for i in range(len(a)-1):
    if a[i] == 'C' and a[i+1] == 'F':
        r = 'Yes'
        break
print(r)

Solution (Python):
a = input()
b = list(a)
s = 0
for i in range(len(b)):
    if b[i] == 'C' and 'F' in b[i:]:
        print('Yes')
        s = 0
        break
    else :
        s = 1
if s == 1:
    print('No')

Solution (Python):
s = input()
if s.count('C') == 0 or s.count('F') == 0:
    print('No')
else:
    s = s[s.find('C'):]
    if s.count('F') == 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
s = input()
if s.count('C') == 0 or s.count('F') == 0:
    print('No')
else:
    s = s[s.find('C'):]
    if s.count('F') == 0:
        print('No')
    else:
        print('Yes')

Solution (Python):
def main():
    s = input()
    if s.count('C') == 0 or s.count('F') == 0:
        print('No')
        return
    l = len(s)
    s = s[s.find('C'):]
    if s.count('F') == 0:
        print('No')
    else:
        print('Yes')
main()

Solution (Python):
s = input()
f = False
l = False
for i in range(len(s)):
    if s[i] == 'C':
        for j in range(i, len(s)):
            if s[j] == 'F':
                print('Yes')
                f = True
                break
        if f == False:
            print('No')
        l = True
        break
if l == False:
    print('No')

Solution (Python):
s=input();a=b=0
for i in range(len(s)):
  if s[i]=='C':a=1
  if s[i]=='F'and a==1:b=1
print('Yes'*b or'No')

Solution (Python):
s=input()
if 'C' in s and 'F' in s:
    c = s.index('C')
    f = len(s) - s[::-1].index('F') - 1
    if c<f:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
import re
S = input()
print("Yes" if re.match(".*C.*F.*", S) else "No")

Solution (Python):
s = input()

found = False
ans = 'No'
for i in range(len(s)):
    if s[i] == 'C':
        found = True
    if found and s[i] == 'F':
        ans = 'Yes'
        break
print(ans)

Solution (Python):
s = input()
C = s.find("C")
F = s.rfind("F")
if C != -1 and F != -1 and C < F:
	print("Yes")
else:
	print("No")

Solution (Python):
s = input()
f = False
l = False
for i in range(len(s)):
    if s[i] == 'C':
        for j in range(i, len(s)):
            if s[j] == 'F':
                print('Yes')
                f = True
                l = True
                break
        if f == False:
            print('No')
            l = True
            break
        else:
            l = True
            break
if l == False:
    print('No')

Solution (Python):
s=input()

Cflag=0

for i in range(len(s)):
  if s[i]=='C':
    Cflag=1
  if s[i]=='F' and Cflag==1:
    print('Yes')
    exit()
    
print('No')

Solution (Python):
s=input()
c=s.find("C")
f=s.rfind("F")
if c>=0 and f>=0 and c<f:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
c = False
f = False
for i in s:
  if i == 'C':
    c = True
  
  if c == True and i == 'F':
    f = True
    break
if c and f:
  print('Yes')
else:
  print('No')

Solution (Python):
s=input()
print('Yes' if 0<=s.find('C')<s.rfind('F') else 'No')

Solution (Python):
S = [x for x in input()]
b = 101
e = 0

for k in range(len(S)):
    if S[k]=="C":
        b = k
        break

for k in range(1,len(S)):
    if S[-k]=="F":
        e = len(S)-k
        break

print("Yes" if b<e else "No")

Solution (Python):
import sys
S = input().strip()

for j in range(len(S)):
  for k in range(j+1,len(S)):
    if S[j] == 'C' and S[k] == 'F':
      print('Yes')
      sys.exit()
print('No')

Solution (Python):
a = False
for i in input():
    if(i == "C"):
        a = True
    elif(a and i == "F"):
        print("Yes")
        break
else:
    print("No")

Solution (Python):
s=input().rstrip()
if 'C' in s and 'F' in s:
  indC,indF=100,0
  for i in range(len(s)):
    if s[i] == 'C':
      indC = min(indC,i)
    elif s[i] == 'F':
      indF = max(indF,i)
    if indC < indF:
      print('Yes')
      exit()
  print('No')
else:
  print('No')

Solution (Python):





if __name__ == '__main__':
    import re
    s = input()
    
    
    
    if re.search('C.*F', s):
        print('Yes')
    else:
        print('No')

Solution (Python):





if __name__ == '__main__':
    s = input()
    cf = 'CF'
    count = 0

    for si in s:
        if count == 0 and si == cf[0]:
            count += 1
        elif count == 1 and si == cf[1]:
            print('Yes')
            exit()

    print('No')

Solution (Python):
s = input()
if "C" in s:
  num = s.index("C")
  if "F" in s[num:]: print("Yes")
  else: print("No")
else: print("No")

Solution (Python):
s=input()
count=0
for i in range(len(s)):
    if s[i]=="C":
        for j in range(len(s[i+1:])):
            if s[j+i+1]=="F" :
                print("Yes")
                count=1
                break
        break
if count==0:
    print("No")

Solution (Python):
def getinputdata():

    
    array_result = []
    
    data = input()

    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result

arr_data = getinputdata()

s = arr_data[0][0]


cnt1 = s.find("C")
cnt2 = s.find("F", cnt1)



print("Yes" if 0 <= cnt1 < cnt2 else "No")

Solution (Python):
s = input()
c = 0
for i in s:
    if i == 'C':
        c = 1
    if c == 1 and i == 'F':
        print('Yes')
        break
else:
    print('No')

Solution (Python):
s = input()
idx1 = s.find('C');

if idx1 >= 0 :
    idx2 = s.find('F',idx1+1)
    if idx2 > idx1 :
        print("Yes");
    else:
        print("No");
else:
    print("No");

Solution (Python):
a = input()

n = len(a)

b = 0

for i in range(n):
    for j in range(i,n):
        if a[i] =='C' and a[j] =='F':
            b = 1
if b == 0:
    print('No')
else:
    print('Yes')

Solution (Python):
s = list(input())
a = 0
b = 0
for i in range(len(s)):
  if s[i] == 'C':
    a = 1
  if s[i] == 'F' and a == 1:
    b = 1
print(['No', 'Yes'][b])

Solution (Python):
import sys
s=input()
if("C" in s and "F" in s):
  for i in range(len(s)):
    if(s[i]=="C"):
      c=i
      break
  for i in range(len(s))[::-1]:
    if(s[i]=="F"):
      f=i
      break
  if(c<f):
    print("Yes")
    sys.exit()
print("No")

Solution (Python):
s = list(str(input()))
key = 0
for i in range(len(s)):
  if s[i] == "C" or key == 1:
    key = 1
    if s[i] == "F":
      print("Yes")
      exit()
print("No")

Solution (Python):
def main():
    S = input()

    if "C" not in S:
        print("No")
        return

    c_idx = S.index("C")
    if "F" not in S[c_idx + 1:]:
        print("No")
        return

    print("Yes")

if __name__ == '__main__':
    main()

Solution (Python):
S=input()
flag=0
for i in S:
    if flag==0 and i=="C":
        flag=1
    if flag==1 and i=="F":
        flag=2
if flag==2:
    print("Yes")
else:
    print("No")

Solution (Python):



import re

def main():
    S = input()

    ok = bool(re.search(r"C.*F", S))
    print("Yes" if ok else "No")

if __name__ == "__main__": main()

Solution (Python):
S = input()
c = S.find('C')
f = S.rfind('F')
if c < 0 or f < 0:
    print('No')
else:
    print('Yes' if c<f else 'No')

Solution (Python):

import re
s = input()
print('Yes' if (re.match(r'.*C.*F', s)) else 'No')

Solution (Python):
s=input()
t='CF'
j=0
for i in range(len(s)):
  if j<2 and s[i]==t[j]:
    j+=1
print('Yes' if j==2 else 'No')

Solution (Python):
def solve():
    s = input()
    C_index, F_index = -1, -1
    for i, c in enumerate(s):
        if c == "C" and C_index == -1:
            C_index = i
        if c == "F":
            F_index = i
    if C_index < F_index and C_index > -1 and F_index > -1:
        print("Yes")
    else:
        print("No")
        
solve()

Solution (Python):
s = input()
flag = False
for i in range(len(s)):
    if s[i] == 'C':
        for j in range(i,len(s)):
            if s[j] == 'F':
                flag = True

if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
 
ans_flag = False
for i in range(len(s)-1):
    if s[i] == "C":
        if "F" in s[i+1:]:
            ans_flag = True
            break
        else:
            break
 
if ans_flag == True:
    print("Yes")
else:
    print("No")

Solution (Python):
import re;print(["Yes","No"][re.match(".*C.*F",input())is None])

Solution (Python):
s = input()

ans_flag = False
for i in range(len(s)-1):
    if s[i] == "C":
        if "F" in s[i+1:]:
            ans_flag = True

if ans_flag == True:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
print('Yes'if 0<=s.find('C')<s.rfind('F')else'No')

Solution (Python):
s=str(input())
p=[chr(i) for i in range(65, 65+26)]
p.remove("C")
p.remove("F")
for i in p:
    s=s.replace(i,'')
 
if 'CF' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
import re
print"Yes"if re.search("C.*F",raw_input())else"No"

Solution (Python):


def main():
    s = input().strip()
    find_c = False
    for c in s:
        if find_c:
            if c == "F":
                print("Yes")
                return
        elif c == "C":
            find_c = True
    print("No")
    return

main()

Solution (Python):
from sys import stdin
a = stdin.readline().strip()
ans = 'Yes'
if 'C' not in a:
 ans = 'No'
else:
 b = a.split('C')[1:]
 b = ''.join(b)
 if 'F' not in b:
  ans = 'No'
print ans

Solution (Python):
s=str(input())
p=list('ABDEGHIJKLMNOPQRSTUVWXYZ')
for i in p:
    s=s.replace(i,'')

if 'CF' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
import re
print("Yes" if re.match('.*C.*F.*', input()) else "No")

Solution (Python):
import re
s = input()
is_match = re.match('.*C.*F.*', s)
if is_match:
    print('Yes')
else:
    print('No')

Solution (Python):
s = raw_input()
fil = filter(lambda x:x == "C" or x == "F",s)
flag = False
for var in fil:
    if var == "F" and flag:
        print "Yes"
        exit()
    flag = var == "C"
print "No"

Solution (Python):
s = input()
c = s.find('C')
print('Yes' if c >= 0 and s.find('F', c) >= 0 else 'No')

Solution (Python):
a = raw_input()
flag = -1
for z in range(0, len(a)) :
    if 'C' == a[z]:
        flag = z
if flag == -1:
    print 'No'
else:
    flag2 = -1
    for z in range(flag+1, len(a)):
        if 'F' == a[z]:
            flag2 = z
    if flag2 == -1:
        print 'No'
    else:
        print 'Yes'

Solution (Python):
s = raw_input()
c = s.find('C')
if c <= len(s):
    f = s[c:].find('F')
    if f >= 1:
        print 'Yes'
    else:
        print 'No'
else:
    print 'No'

Solution (Python):
s = input()


def main(s):
    if 'C' in s and 'F' in s:
        for i in range(s.count('C')):
            if i != 0:
                s_l = list(s)
                del s_l[c_i]
                s = ''.join(s_l)
            c_i = s.index('C')
        for i in range(s.count('F')):
            if i != 0:
                s_l = list(s)
                del s_l[f_i]
                s = ''.join(s_l)
            f_i = s.index('F')

        if c_i <= f_i:
            return 'Yes'
        else:
            return 'No'
    else:
        return 'No'

print(main(s))

Solution (Python):
ini=raw_input()
a=list(ini)
check=0
if "C" in a and "F" in a:
	c=a.index("C")
	f=0
	for i in range(len(a)):
		if a[i]=="F":
			f=i
	if c<f:
		check=1
if check==1:
	print "Yes"
else:
	print "No"

Solution (Python):


s = raw_input()

out = 'No'
for i, c in enumerate(s):
    if c == 'C':
        for c in s[i + 1:]:
            if c == 'F':
                out = 'Yes'
                break


print out

Solution (Python):
a = raw_input()

c = []
f = []
for i in range(len(a)):
    if a[i] == 'C':
        c.append(i)

    elif a[i] == 'F':
        f.append(i)

if c==[] or f==[]:
    print 'No'
elif min(c)<max(f):
    print 'Yes'

else:
    print 'No'

Solution (Python):
s = raw_input()

c = []
f = []
for i in xrange(len(s)):
    if s[i] == 'C':
        c.append(i)
    elif s[i] == 'F':
        f.append(i)

if len(c) and len(f) and c[0]<f[-1]:
    print 'Yes'
else:
    print 'No'

Solution (Python):
line = input()
if "C" in line and "F" in line:
    if line.index("C") < line.index("F"):
        print('Yes')
    elif line.index("C") > line.index("F"):        
        line1 = line[line.index("C"):]
        
        if "F" in line1:
            print('Yes')
        else:
            print('No')
    else:
        print('No')    
else:
    print('No')

Solution (Python):
import sys 
s = sys.stdin.readline().strip()
c_find = False                                                                                                                                                                                                                        
f_find = False
for c in s:
    if c_find:
        if c == 'F':
            print 'Yes'
            exit(0)
    else:
        if c == 'C':
            c_find = True
print 'No'

Solution (Python):
s = raw_input()
c = s.find('C')
if c == -1:
    print 'No'
else:
    f = s[c+1:].find('F')
    if f == -1:
        print 'No'
    else:
        print 'Yes'

Solution (Python):
s=raw_input()
c=s.find('C')
if c+1:
    f=s[c:].find('F')
    if f+1:
        print "Yes"
    else:
        print "No"
else:
    print "No"

Solution (Python):
s = list(input())

offset_f = []
offset_c = []
for i in range(len(s)):
        if s[i] == 'F':
                offset_f += [i]

offset_f.sort()


for i in range(len(s)):
        if s[i] == 'C':
                offset_c += [i]

offset_c.sort()


if offset_f and offset_c:
        if offset_f[-1] > offset_c[0]:
                print('Yes')
        else:
                print('No')
else:
        print('No')

Solution (Python):
s = input()
i, j = [s.find('C'), s.rfind('F')]
j = -2 if i == -1 or j == -1 else j
print("Yes" if i < j else "No")

Solution (Python):
s = raw_input()
s = filter(lambda x: x == 'C' or x == 'F', s)

flag = False
if 'C' not in s:
    flag= True
    print "No"

if not flag:
    flag = False
    i = s.index('C')
    s_ = filter(lambda x: x== 'F', s[i:len(s)])
    if len(s_) == 0:
        print "No"
        flag = True

    if not flag:
        print "Yes"

Solution (Python):
def main():
    s = input()
    for i, c1 in enumerate(s):
        if c1 == 'C':
            for c2 in s[i+1:]:
                if c2 == 'F':
                    print('Yes')
                    return
            else:
                print('No')
                return
    else:
        print('No')

if __name__ == '__main__':
    main()