stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string s;

int main()

{

	cin>>s;

	for(int i=0;i<s.size();i++)

	{

		if(s[i]=='C')

		{

			for(int j=i+1;j<=s.size();j++)

			{

				if(s[j]=='F') 

				{

					cout<<"Yes";

					return 0;

				}

			}

		}

	}

	cout<<"No";

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.309559122172011x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

string a;   

bool v[2];



int main() {    

    cin >> a;

    for(int i = 0; i < a.length(); i ++) {

        if(a[i]=='C') v[0] = 1;

        if(a[i]=='F' && v[0]) {

        	printf("Yes\n");

        	return 0;

		}

    }

    printf("No\n");

}

// Faster C++ solution for the same problem (measured speedup: 5.255208928537878x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    string a;

    cin>>a;

    int cnt=0;  //用来标记

    for(int i=0;i<a.size();i++){

        if(a[i]=='C'){

            cnt=1;

        }

        if(a[i]=='F'&&cnt==1){

            cout<<"Yes";

            return 0;

        }

    }

    cout<<"No";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.349272361635466x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<string>

using namespace std;

string s;

int l;

int main()

{

    cin>>s;

    l=s.size();

    for(register int i=0;i<l;i++)

    {

        if(s[i]=='C')

        {

            for(register int j=i+1;j<l;j++)

            {

                if(s[j]=='F')

                {

                    cout<<"Yes";

                    return 0;

                }

            }

        }

    }

    cout<<"No";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.30925860043456x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<fstream>

#include<algorithm>

#include<string>

using namespace std;

string st;

int k;

int main()

{

     cin>>st;

     for(int i=0;i<=st.size();i++) 

     {

     	if(st[i]=='C')k=1;

     	if(k==1&&st[i]=='F')

		{

		 	cout<<"Yes";

		 	return 0;

		}

     }

     cout<<"No";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.307706306980556x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string s;

long long x,y,l;

int main()

{

    getline(cin,s);

    l=s.size();

    x=-1;

    y=-1;

    for(int i=0;i<l;i++)

    {

    	if(s[i]=='C') 

    	{

    		x=i;

    		break;

    	}

    }

    for(int i=0;i<l;i++)

    {

    	if(s[i]=='F') 

    	{

    		y=i;

    	}

    }    

    if(x!=-1 && y!=-1 && x<y) cout<<"Yes";

    else cout<<"No";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.302306783713003x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

#define fi first

#define se second

#define pii pair<int,int>

#define mp make_pair

#define pb push_back

#define space putchar(' ')

#define enter putchar('\n')

#define eps 1e-10

#define MAXN 100005

//#define ivorysi

using namespace std;

typedef long long int64;

typedef unsigned int u32;

typedef double db;

template<class T>

void read(T &res) {

    res = 0;T f = 1;char c = getchar();

    while(c < '0' || c > '9') {

    if(c == '-') f = -1;

    c = getchar();

    }

    while(c >= '0' && c <= '9') {

    res = res * 10 +c - '0';

    c = getchar();

    }

    res *= f;

}

template<class T>

void out(T x) {

    if(x < 0) {x = -x;putchar('-');}

    if(x >= 10) {

    out(x / 10);

    }

    putchar('0' + x % 10);

}

string s;

void Solve() {

    cin >> s;

    bool f = 0;

    for(int i = s.length() - 1 ; i >= 0 ; --i) {

    if(s[i] == 'F') f = 1;

    if(s[i] == 'C' && f) {

        puts("Yes");return;

    }

    }

    puts("No");

}



int main() {

#ifdef ivorysi

    freopen("f1.in","r",stdin);

#endif

    Solve();

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.294198485457776x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

	string s;

	cin>>s;

	int i,l=-1,r=-1;

	for(i=0;i<=s.size()-1;i++)

	{

		if(s[i]=='C') l=i;

	}

	if(l==-1)

	{

		cout<<"No";

		return 0;

	}

	for(i=l;i<=s.size()-1;i++)

	{

		if(s[i]=='F') r=i;

	}

	if(r==-1) cout<<"No";

	else cout<<"Yes";

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3053010845154684x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdlib>

#include<cstdio>

#include<cstring>

#include<string>

#include<cmath>

using namespace std;



int main()

{

	int len,i,j;

	char s[105];

	bool ok=false;

	scanf("%s",s);

	len=strlen(s);

	for(i=0;i<len;i++)

	{

		if(s[i]=='C')

		{

			for(j=i+1;j<len;j++)

			{

				if(s[j]=='F') ok=true;

			}

		}

	}

	if(ok==true) cout<<"Yes"<<endl;

	if(ok==false)cout<<"No"<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.2798051863025055x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cstring>

#include <string>

#define N 105

using namespace std;

char s[N];

int len;

bool a, b;

int main()

{

	scanf("%s", s);

	len = strlen(s);

	for(int i = 0; i < len; i++)

	{

		if(s[i] == 'C')

			a = true;

		if(s[i] == 'F' && a)

			b = true;

		if(a && b)

			break;

	}

	if(a && b)

		printf("Yes");

	else

		printf("No");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.25879707649604x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



string a;

int main(){

	cin>>a;

	for(int i=0;i<=a.length();i++){

		if(a[i]=='C'){

			for(int j=i;j<=a.length();j++){

				if(a[j]=='F'){

					cout<<"Yes"<<endl;

					return 0;

				}

			}

		}

	}

	cout<<"No"<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.320831387741643x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string s;

vector<char>a;

int main()

{

    cin>>s;

    for(int i=0;i<s.size();i++)

    {

        if(s[i]=='C'||s[i]=='F')

            a.push_back(s[i]);

    }

    if(a.empty()){

        cout<<"No"<<endl;

    return 0;

    }

    for(int i=0;i<a.size()-1;i++)

    {

        if(a[i]=='C'&&a[i+1]=='F')

        {

            cout<<"Yes"<<endl;

            return 0;

        }

    }

    cout<<"No"<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.330686165158197x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string st;

int x;

int main()

{

	cin>>st;

	for(int i=0;i<st.size()-1;i++)

	  for(int j=i+1;j<st.size();j++)if(st[i]=='C'&&st[j]=='F')x=1;

	if(x)cout<<"Yes";

	  else cout<<"No";

	return 0;

} 

// Faster C++ solution for the same problem (measured speedup: 5.309846702026018x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

string s;

bool a;

int main()

{

    cin>>s;

    int l=s.length();

    for(register int i=0;i<l;++i)

    {

        if(s[i]=='C')

        {

            a=1;

        }

        if(a&&s[i]=='F')

        {

            printf("Yes");

            return 0;

        }

    }

    printf("No");

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.29700516486006x):
#include<stdio.h>

#include<string.h>

int main()

{char a[101];

scanf("%s",a);

int l=strlen(a);

int i,j;

for(i=0;i<l;i++)

{if(a[i]=='C'){



	for(j=i+1;j<l;j++)

{

	if(a[j]=='F'){

		printf("Yes");

	return 0;

	}

	}



}

}



	printf("No");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string a;

bool y;

int main()

{

    cin>>a;

	for(int i=0;i<a.size();i++)

	{

		if(a[i]=='F'&&y==1)

		{

			cout<<"Yes"<<endl;

			return 0;

		}

		if(a[i]=='C')

		{

			y=1;

		}

	}

	cout<<"No"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.326479818380428x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

char a[10001];

int main(){

cin>>a+1;

int M=strlen(a+1);

    for(int i=1;i<=M;i++){

        for(int j=i;j<=M;j++){

        if(a[i]=='C'&&a[j]=='F'){

            puts("Yes");

            return 0;

        }

        }

    }

    puts("No");

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.256375685567773x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

char s[110];

int main()

{

	int c=1000,f=-1;

	scanf("%s",&s);

	for(int i=0;i<strlen(s);i++)

	{

		if(s[i]=='C'&&c>i)c=i;

		if(s[i]=='F'&&f<i)f=i;

	}

	if(c<f)printf("Yes\n");

	else printf("No\n");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.263745342767603x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<iostream>

#include<cstring>

using namespace std;



string a,b="CF"; 

int al,bl;



int main(){

    getline(cin,a);

    al=a.length();

    for(int i=0;i<al;i++)

        if(a[i]==b[bl]){ 

            bl++;

            if(bl==2)  

                break;

        }

    if(bl==2) cout<<"Yes"; 

    else cout<<"No";

    cout<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.315457792171799x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

	string s;

	cin>>s;

	bool flag=false;

	for(int i=0;i<s.size();i++)

	{

		if(s[i]=='C')

		{

			for(int j=i;j<s.size();j++)

			{

				if(s[j]=='F'){

					flag=true;

//					cout<<"gada";

				}

			}

		}

	}

	if(flag==true)

		printf("Yes");

	else printf("No");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.299725796615521x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

long long i,n;

string s;

int main()

{

	cin>>s;

	for (i=0;i<s.size();i++)

	  if (s[i]==67) n++;else

	    if (s[i]==70&&n>0) {cout<<"Yes";return 0;}

	cout<<"No"<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.323667286473513x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string s;

int l;

int main()

{

    cin>>s;

    l=s.size();

    for(register int i=0;i<l;i++)

    {

        if(s[i]=='C')

        {

            for(register int j=i+1;j<l;j++)

            {

                if(s[j]=='F')

                {

                    cout<<"Yes";

                    return 0;

                }

            }

        }

    }

    cout<<"No";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3146720615777205x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string s;

int l;

int main(){

    cin>>s;

    l=s.size();

    for(register int i=0;i<l;i++){

        if(s[i]=='C'){

            for(register int j=i+1;j<l;j++){

                if(s[j]=='F'){

                    cout<<"Yes";

                    return 0;

                }

            }

        }

    }

    cout<<"No";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3146720615777205x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string s;

int l;

int main(){

    cin>>s;

    l=s.size();

    for( register int i=0;i<l;i++){

        if(s[i]=='C'){

            for( register int j=i+1;j<l;j++){

                if(s[j]=='F'){

                    cout<<"Yes";

                    return 0;

                }

            }

        }

    }

    cout<<"No";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3146720615777205x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

char str[200];

int main()

{

	fgets(str,199,stdin);

	int l(strlen(str));

	for(register char *p=str;*p;++p)

		if(*p=='C')

			for(register char *pl=++p;*pl;pl++)

			{

				if(*pl=='F')

				{

					fwrite("Yes",3,1,stdout);

					return 0;

				}

			}

	fwrite("No",2,1,stdout);

}

// Faster C++ solution for the same problem (measured speedup: 5.254006502069484x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<iostream>

#include<string>

using namespace std;

int main()

{

	string s;

	cin>>s;

	for(int i=0;i<s.size();i++)

	{

		if(s[i]=='C')

			for(int j=i+1;j<s.size();j++)

			{

				if(s[j]=='F') {cout<<"Yes";return 0;}

				}

		}

	cout<<"No";

	return 0;

	}


// Faster C++ solution for the same problem (measured speedup: 5.3107675070678875x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<string>

using namespace std;

 int q,p,w[1000001],u[1000001],o;

 string a;

 int main()

 {

     cin>>a;//首先输入字符串

     for (int i=0;i<a.size();i++)//从0位开始循环

     {

         if (a[i]=='C') 

         {

             p++;

             u[p]=i+1;

         }//判断是否发现C这个东西，并统计其位置

         else if (a[i]=='F')

         {

            q++;

             w[q]=i+1;

         }

     }//判断是否发现F，同理 统计位置情况

     if (q>=1 && p>=1)

     {

     for (int i=1;i<=p;i++)

     {

         for (int j=1;j<=q;j++)

         {

             if (u[i]<w[j])

             {

                 o=1;

             }

         }

     }//循环，找到C是否在F的前面

     if (o==1) cout<<"Yes"<<endl;//在前面则Yes

     else cout<<"No"<<endl;//否则No   

     }

     else cout<<"No"<<endl;//不存在两个数，直接No

     //以上为全部过程，希望能理解。

 }

// Faster C++ solution for the same problem (measured speedup: 5.327606795254001x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<bits/stdc++.h>



using namespace std;

string st;

int cs[90+5],s,P;

int main()

{

	cin>>st;

	for(int i=0;i<st.length();i++)

	{

		cs[st[i]]++;

		if(s==0)

		{

			if(st[i]==67)P=1;

			else if(P==1&&st[i]==70)P=3,s=1;

			else if(st[i]==70)P=2;

		}

		else break;

	}

	if(cs[67]>=1&&cs[70]>=1&&P==3)cout<<"Yes\n";

	else cout<<"No\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.315679667675902x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string s;

int main()

{

	cin>>s;

	for(int i=0;i<s.size();i++)

	{

		if(s[i]=='C')

		{

			for(int j=i+1;j<s.size();j++)

			{

				if(s[j]=='F')

				{

					cout<<"Yes";

					return 0;

				}

			}

		}

	}

	cout<<"No";

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.31497156690793x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<bits/stdc++.h>

#include<cstdio>

#include<string>

using namespace std;

 int q,p,w[1000001],u[1000001],o;

 string a;

 int main(){cin>>a;

     for (int i=0;i<a.size();i++){if (a[i]=='C'){p++;u[p]=i+1;}

         else if (a[i]=='F'){q++;w[q]=i+1;}}

     if (q>=1 && p>=1){

     for (int i=1;i<=p;i++){

         for (int j=1;j<=q;j++){

             if (u[i]<w[j]){

                 o=1;}}}

     if (o==1) cout<<"Yes"<<endl;

     else cout<<"No"<<endl; }

     else cout<<"No"<<endl;

     return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.327606795254001x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

string a;

int main()

{

    cin>>a;

    bool flag1=false,flag2=false;

	for(int i=0;i<a.size();i++)

	{

		if(a[i]=='C')

			flag1=true;

		if(a[i]=='F')

			if(flag1)

			{

				cout<<"Yes"<<endl;

				exit(0);

			}

			else

				continue;

	}

	cout<<"No"<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.327776692276649x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    string a;

    cin>>a;

    if(int(a.find('C'))!=-1&&int(a.rfind('F'))!=-1&&a.find('C')<a.rfind('F'))//个人码风问题，习惯用and而不是&&

        cout<<"Yes";

    else

        cout<<"No";

        return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.315365151132791x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
// <   .cpp> // ::

// This file is created by Bandit.

// Copyright (C) 2019 S.F.L.S , Inc.

// I don't know what this program is.

#include<bits/stdc++.h>

#define N

using namespace std;



inline int read()

{

    int x=0,f=1; char ch=getchar();

    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}

    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}

    return x*f;

}



string s;

bool f;



int main()

{

	cin>>s;

	for (register int i=0;i<s.length();i++)

	  if (s[i]=='C')

	    for (register int j=i+1;j<s.length();j++)

	      if (s[j]=='F')

	      {

	      	 cout<<"Yes"<<endl;

	      	 return 0;

	      }

    cout<<"No"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.3261920315737x):
#include<stdio.h>

#include<string.h>

char s[101];

int main() {

	scanf("%s",s);

	if(strchr(s,'C')!=NULL) {

		if(strchr(strchr(s,'C'),'F')!=NULL) return 0&printf("Yes");

	}

	printf("No");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

char ch[1314520];

int main(){

	scanf("%s",ch);

	int a=0;

	for(int i=0;i<strlen(ch);i++){

		if(ch[i]=='C'&&!a){

			a++;

			continue;

		}

		if(ch[i]=='F'&&a==1){

			printf("Yes\n");

			return 0;

		}

	}

	printf("No\n");

	return 0;

} 

// Faster C++ solution for the same problem (measured speedup: 5.270743427176133x):
#include<stdio.h>

#include<string.h>

int main(){

	char c[5000];

	int x=0,i,j,l;

	scanf("%s",c);

	l=strlen(c);

	for(i=0;i<l;i++){

		if(x==0&&c[i]=='C'){

			x++;

		}

		if(x==1&&c[i]=='F'){

			printf("Yes");

			return 0;

		}

	}

	printf("No");

	return 0;

}