stablegradients/pie-gem5-pairs huggingface dataset:
// 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.312363809772108x):
#include<cstdio>

#include<cstring>

char a[105];

int main(){

	scanf("%s",a);

	for(int i=0;i<=strlen(a)-1;i++){

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

			for(int j=strlen(a)-1;j>i;j--)

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

					printf("Yes");

					return 0;

				}

	}

	printf("No");

	return 0;

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

using namespace std;

char s[1000001];

int main(){

	int i;

	scanf("%s",s);

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

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

	for(;i<strlen(s);i++)

		if(s[i]=='F'){printf("Yes\n");return 0;}

	printf("No\n");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.262022675770855x):
#include<cstdio>

#include<cstring>

char a[105];

int main(){

	scanf("%s",a);

	for(int i=0;i<=strlen(a)-1;i++){

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

			for(int j=strlen(a)-1;j>i;j--)

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

					printf("Yes");

					return 0;

				}

	}

	printf("No");

	return 0;

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

#include<string>

using namespace std;

int main()

{

    char c;

    bool flag=false;

    while(cin>>c){if (c=='C') flag=true;if (flag&&c=='F') {cout<<"Yes";return 0;}}

    cout<<"No";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3085659120676105x):
#include<cstdio>

#include<cstring>

char a[105];

int main(){

	scanf("%s",a);

	for(int i=0;i<=strlen(a)-1;i++){

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

			for(int j=strlen(a)-1;j>i;j--)

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

					printf("Yes");

					return 0;

				}

	}

	printf("No");

	return 0;

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

#include<cmath>

#include<algorithm>

#include<cctype>

#include<cstring>

#include<queue>

#include<iostream>

#include<map>

using namespace std;

typedef long long ll;

typedef double lf;

typedef unsigned un;

typedef int in;

#define mian main

#define maxn 10000+10

#define maxm 10000+10

#define _(a) read(a)

#define non void

#define inf 2147483647

#define bre break

#define con continue

#define prq priority_queue

#define re register

#define bu bool

#define cz char

#define cst const

#define ope operator

#define inl inline

#define upp upper_bound

#define low lower_bound

#define next_per next_permutation

cz obuf[1<<23],*O=obuf,buf[1<<23],*L=buf,*R=buf;

inl cz gc(){return L==R&&(R=(L=buf)+fread(buf,1,100000,stdin),L==R)?EOF:*L++;}

template<typename T>inl T Max(T a,T b){return a>b?a:b;}

template<typename T>inl T Min(T a,T b){return a<b?a:b;}

template<typename T>inl T Abs(T a){return a<0?-a:a;}

template<typename T>inl non read(T &a){a=0;T k=1;char c=gc();while(c<'0'||c>'9')k=c=='-'?-1:k,c=gc();while(c>='0'&&c<='9')a=a*10+(c^48),c=gc();if(c!='.'){a*=k;return;}T t=0.1;while(c<'0'||c>'9')c=gc();while(c>='0'&&c<='9')a+=t*(c^48),c=gc(),t*=0.1;a*=k;}

template<typename T>non print(T x){if(x>9)print(x/10);*O++=x%10+'0';}

template<typename T>non out(T a,cz t='\n'){print(a);*O++=t;}

non fresh(){fwrite(obuf,O-obuf,1,stdout);}

string s;

in n,i;

bu a;

in main()

{

	cin>>s;

	n=s.size();

	for(i=0;i<n;++i)if(s[i]=='C')bre;

	for(;i<n;++i)if(s[i]=='F')a=1;

	if(a)*O++='Y',*O++='e',*O++='s';

	else *O++='N',*O++='o';

	*O++='\n',fresh();

	//freopen("a.in","r",stdin);

	//freopen(".out","w",stdout);

}


// Faster C++ solution for the same problem (measured speedup: 5.2979428479281525x):
#include<cstdio>

#include<cstring>

char a[105];

int main(){

	scanf("%s",a);

	for(int i=0;i<=strlen(a)-1;i++){

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

			for(int j=strlen(a)-1;j>i;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;

int main(){

	char a[10000];

	int b=0,c=0,d=0;

	cin>>a;

	b=strlen(a);

	for(int i=0;i<b;i++){

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

			c=1; 

		}

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

			d=1;

		}

	}

	if(c>0&&d>0) cout<<"Yes"<<endl;

	else cout<<"No"<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.324762055602736x):
#include<cstdio>

#include<cstring>

char a[105];

int main(){

	scanf("%s",a);

	for(int i=0;i<=strlen(a)-1;i++){

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

			for(int j=strlen(a)-1;j>i;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 a;

int main()

{

	cin.tie(0);

	cout.tie(0);

	cin>>a;

	int len=a.size();

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

	{

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

		{

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

			{

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

				{

					printf("Yes");

					return 0;

				}

			}

			break;

		}

	}

	printf("No");

	return 0;

} 

// Faster C++ solution for the same problem (measured speedup: 5.307125705842187x):
#include<cstdio>

#include<cstring>

char a[105];

int main(){

	scanf("%s",a);

	for(int i=0;i<=strlen(a)-1;i++){

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

			for(int j=strlen(a)-1;j>i;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;

 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.325292925675171x):
#include<cstdio>

#include<cstring>

char a[105];

int main(){

	scanf("%s",a);

	for(int i=0;i<=strlen(a)-1;i++){

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

			for(int j=strlen(a)-1;j>i;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 a1;

	cin>>a1;

	int a=a1.length();

	//reverse(a1,a1+a);

	if(a1.find('C')==a1.npos|a1.find('F')==a1.npos)

		cout<<"No";

	else if(a1.find_first_of('C')<a1.find_last_of('F') )cout<<"Yes";

	else cout<<"No";

}

// Faster C++ solution for the same problem (measured speedup: 5.312643954869217x):
#include<cstdio>

#include<cstring>

char a[105];

int main(){

	scanf("%s",a);

	for(int i=0;i<=strlen(a)-1;i++){

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

			for(int j=strlen(a)-1;j>i;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.326567607261071x):
#include<stdio.h>

#include<string.h>

char ch[10000010];

bool flag;

int main ( )

{

    scanf("%s",ch);

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

    {

        if(ch[i]=='C')flag=1;

        if(ch[i]=='F'&&flag)

            return puts("Yes")&0;

    }

    puts("No");

    return 0;

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

#include <cstdio>

#include <string>



using namespace std;



int main()

{

	string s;

	cin >> s;

	int i, s_l = s.length();

	int tot = 0;

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

	{

		if (s[i] == 'C' && tot == 0)

			tot++;

		else if (s[i] == 'F' && tot == 1)

			tot++;

	}

	if (tot == 2)

		printf("Yes");

	else

		printf("No");

	return 0;

}

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

#include<string.h>

char ch[10000010];

bool flag;

int main ( )

{

    scanf("%s",ch);

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

    {

        if(ch[i]=='C')flag=1;

        if(ch[i]=='F'&&flag)

            return puts("Yes")&0;

    }

    puts("No");

    return 0;

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

using namespace std;

char c[10001];

int a=999999,b;

int main()

{

    cin>>c;

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

    {

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

        {

            a=i; break;

        }

    }

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

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

      b=i;

    if(a<b)

     printf("Yes\n");

    else

     printf("No\n");

     return 0;

}

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

#include<string.h>

char ch[10000010];

bool flag;

int main ( )

{

    scanf("%s",ch);

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

    {

        if(ch[i]=='C')flag=1;

        if(ch[i]=='F'&&flag)

            return puts("Yes")&0;

    }

    puts("No");

    return 0;

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

#include <cstdio>

#include <cstring>



using namespace std;



const int kmaxN = 10000 + 10;

char c[kmaxN];

int mark1,mark2;



int main()

{

	cin >> c;

	int l = strlen(c);

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

	{

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

			mark1 = 1;

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

		{

			mark2 = 1;

			break;

		}

	}

	if(mark1 == 1 && mark2 == 1)

		cout << "Yes";

	else

		cout << "No";

	return 0;

}

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

#include<string.h>

char ch[10000010];

bool flag;

int main ( )

{

    scanf("%s",ch);

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

    {

        if(ch[i]=='C')flag=1;

        if(ch[i]=='F'&&flag)

            return puts("Yes")&0;

    }

    puts("No");

    return 0;

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

#include <iostream>

#include <cstdio>

#include <string>

using namespace std;

int main()

{

    string word;

    cin>>word;

    int l=word.size(),cnt=0;

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

    {

        if(word[i]=='C'&&!cnt)  cnt++;

        if(word[i]=='F'&&cnt)  

        {

            cnt++;break;

        }

    }

    if(cnt==2)  printf("Yes\n");

    else  printf("No\n");

    return 0;

}

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

#include<string.h>

char ch[10000010];

bool flag;

int main ( )

{

    scanf("%s",ch);

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

    {

        if(ch[i]=='C')flag=1;

        if(ch[i]=='F'&&flag)

            return puts("Yes")&0;

    }

    puts("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.317586244386826x):
#include<stdio.h>

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

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

#include <cstdio>

#include <string>



using namespace std;



int main()

{

	string s;

	cin >> s;

	int i, s_l = s.length();

	int tot = 0;

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

	{

		if (s[i] == 'C' && tot == 0)

			tot++;

		else if (s[i] == 'F' && tot == 1)

			tot++;

	}

	if (tot == 2)

		printf("Yes");

	else

		printf("No");

	return 0;

}

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

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

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

using namespace std;

char c[10001];

int a=999999,b;

int main()

{

    cin>>c;

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

    {

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

        {

            a=i; break;

        }

    }

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

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

      b=i;

    if(a<b)

     printf("Yes\n");

    else

     printf("No\n");

     return 0;

}

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

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

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

#include <cstdio>

#include <cstring>



using namespace std;



const int kmaxN = 10000 + 10;

char c[kmaxN];

int mark1,mark2;



int main()

{

	cin >> c;

	int l = strlen(c);

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

	{

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

			mark1 = 1;

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

		{

			mark2 = 1;

			break;

		}

	}

	if(mark1 == 1 && mark2 == 1)

		cout << "Yes";

	else

		cout << "No";

	return 0;

}

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

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

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

#include <iostream>

#include <cstdio>

#include <string>

using namespace std;

int main()

{

    string word;

    cin>>word;

    int l=word.size(),cnt=0;

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

    {

        if(word[i]=='C'&&!cnt)  cnt++;

        if(word[i]=='F'&&cnt)  

        {

            cnt++;break;

        }

    }

    if(cnt==2)  printf("Yes\n");

    else  printf("No\n");

    return 0;

}

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

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

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

using namespace std;

int main(){

	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

	register string st;

	register bool c=false,f=false;

	cin>>st;

	int len=st.length();

	register char ch[len];

	for(int i=0;i<len;i++)ch[i]=st[i];

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

		if(ch[i]=='C')c=true;

		if(c)if(ch[i]=='F')f=true;

		if(c&&f){

			cout<<"Yes\n";

			return 0;

		}

	}

	cout<<"No\n";

	return 0;

}

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

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

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

#include<string>

using namespace std;

string s;

int i,flagc=0,flagf=0;

int main()

{

    cin>>s;

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

    {

        if(s[i]=='C'&&flagf==0)

            flagc=1;

        if(s[i]=='F'&&flagc==1)

            flagf=1;

    }

    if(flagc&&flagf)

        cout<<"Yes"<<endl;

    else

        cout<<"No"<<endl;

    return 0;

}

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

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

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

#include <cstdio>

#include <cstring>

using namespace std;

int main()

{

	string s;

	int flag1=0;

	int flag2=0;

	cin>>s;

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

	{

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

			flag1=1;

		if(s[i]=='F'&&flag1==1)

			flag2=1;

	}

	if(flag1==1&&flag2==1)

		cout<<"Yes"<<endl;

	else

		cout<<"No"<<endl;

	return 0;

}

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

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

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

using namespace std;

string s;

int main()

{

	cin>>s;

	int len=s.size();

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

	{

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

		{

			for(int j=i;j<=len;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.329288648565655x):
#include<stdio.h>

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

}
// 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.3185417934302315x):
#include<stdio.h>

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

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

using namespace std;

char a[500];

int main()

{

	cin>>a;

	int ls=strlen(a);

	for(int i=0;i<ls-1;i++)

	{

		for(int j=i+1;j<ls;j++)

		{

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

			{

				cout<<"Yes";

				return 0;

			}

		}

	}

	cout<<"No";

	return 0;

} 

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

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

}
// 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.3185417934302315x):
#include<stdio.h>

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

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

#include<cstring>

using namespace std;

char b[115];

int main()

{

	int l=0;

	cin>>b;int len=strlen(b);

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

	{

		char a=b[i];

		if(a=='C'&&l==0) l=1;

		if(l==1&&a=='F') l=2;

	}

	if(l==2) cout<<"Yes"<<endl;

	else cout<<"No"<<endl;

	return 0;

}

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

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

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

using namespace std;

string a;

int b;

int main(){

	ios::sync_with_stdio(false);

	cin>>a;

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

		if(a[i]=='C'&&b==0){

			b=1;

			//cout<<i<<endl;

		}

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

			b=2;

			//cout<<i<<endl; 

		}

	}

	if(b==2) cout<<"Yes"<<endl;

	else cout<<"No"<<endl;

	return 0;

} 

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

#include<string.h>

int main()

{

	int count1,count2,i,j,b;

	char a[100];

	scanf("%s",a);

	count1=0;

	count2=0;

	b=strlen(a);

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

	{

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

		{

			count1+=i;

			for(j=count1+1;j<b;j++)

			{

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

			    {

			    	count2+=j;

			    }

			}

			break;

		}

	}

	if(count1<count2)printf("Yes\n");

	else printf("No\n");

}