stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
// ==============================

//  author: memset0

//  website: https://memset0.cn

//  date: 2018.08.06 14:06:24

// ==============================

#include <bits/stdc++.h>

#define ll long long

using namespace std;



int len;

char s[110];



int main() {

	scanf("%s", s), len = strlen(s);

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

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

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

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

					printf("Yes\n");

					return 0;

				}

	printf("No\n");

	return 0;

}

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

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	return 0;

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

using namespace std;

char S[110];

int main()

{

	scanf("%s",S);

	int l=strlen(S);

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

	{

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

		{

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

			{

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

				{

					printf("Yes\n");

					return 0;

				}

			}

		}

	}

	printf("No\n");

	return 0;

}

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

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	return 0;

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

using namespace std;

string s;

int l;

int main()

{

    cin>>s;

    l=s.size();

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

    {

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

        {

            for(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.316620270673134x):
#include <stdio.h>

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	return 0;

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

char a[10010]; 

bool c, f; 

int main() {

    scanf("%s", a); 

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

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

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

    }

    if(f==true) printf("Yes\n"); 

    else printf("No\n"); 

    return 0;

}

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

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	return 0;

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

#include<iostream>

using namespace std;

int main()

{

    string s;

    int f=0;

    getline(cin,s);

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

    {

        if(s[i]=='C'&&!f)f=1;

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

    }

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

    else cout<<"No"<<endl;

    return 0;

}

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

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	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++)//从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.329203415307436x):
#include <stdio.h>

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	return 0;

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

#include<cstdio>

using namespace std;

int main()

{

	string s;

	getline(cin,s);

//	cout<<s<<endl;

	int flag=0,len=s.length();

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

	{

		if(!flag)

		{

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

		}

		if(flag==1)

		{

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

			{

				flag=2;

				break;

			}

		}

	}

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

	else cout<<"No";

	return 0;

}

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

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	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++)//从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.329559745858486x):
#include <stdio.h>

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	return 0;

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

#include<cstdio>

#include<string>

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

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	return 0;

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

#include<iostream>

using namespace std;

char c[111];

int le,f;

int main()

{

    cin>>c;

    le=strlen(c);

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

    {

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

        f=1;

        if(c[i]=='F'&&f!=0)

        {

            cout<<"Yes"<<endl;

            return 0;

        }

    }

    cout<<"No"<<endl;

    return 0;

}

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

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	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; 

     

 }  

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

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	return 0;

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

using namespace std;

int main()

{

    string s;

    cin >> s;

    int c = s.find("C"); 

    int f = s.find("F", c);

    if(c >= s.length() || f >= s.length() || c > f)

        cout << "No" << endl;

    else

        cout << "Yes" << endl;

    return 0;

}

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

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	return 0;

}
// Slower C++ solution:
// luogu-judger-enable-o2

#include<bits/stdc++.h>

using namespace std;

string c;

int main()

{

	cin>>c;

	int n=c.size();

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

	{

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

		{

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

			{

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

				{

					cout<<"Yes";

					return 0;

				}

			}

		}

	}

	cout<<"No";

	return 0;

}

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

#include <string.h>

int main()

{

	char a[101];

	int b,l,i,n,count,m;

	count=0;

	m=0;

	scanf("%s",a);

	l=strlen(a);

	if(l==1)

		printf("No\n");

	else

	{

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

		{

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

			{

				count++;

				break;

				m++;

			}

		}

		

		if(count>0&&i!=l-1)

		{

			n=0;

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

			{

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

				n++;

			}

			if(n>0)

			printf("Yes\n");

			else

			printf("No\n");

		}

		else

		printf("No\n");

		

		

	}

	return 0;

}
// 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.267555980247268x):
#include<cstdio>

#include<cstring>

using namespace std;

const int MAXN=10005;

char Str1[MAXN],Str2[MAXN];

int Len1,Len2;



int main(){

	scanf("%s",Str1);

	Len1=strlen(Str1);

	Str2[0]='C';

	Str2[1]='F';

	Len2=2;

	int j=0;

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

	if(Str1[i]==Str2[j]){

		j++;

		if(j==2){

			printf("Yes");

			return 0;

		}

	}

	

	printf("No");

	return 0;

	

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

#include<string>

#include<cstdio>

using namespace std;

string s;

bool t;

int main(){

	cin>>s;

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

		if(t && s[i]=='F'){

			puts("Yes");

			return 0;

		}

		if(s[i]=='C')t=true;

	}

	puts("No");

	return 0;

}

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

#include<cstring>

using namespace std;

const int MAXN=10005;

char Str1[MAXN],Str2[MAXN];

int Len1,Len2;



int main(){

	scanf("%s",Str1);

	Len1=strlen(Str1);

	Str2[0]='C';

	Str2[1]='F';

	Len2=2;

	int j=0;

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

	if(Str1[i]==Str2[j]){

		j++;

		if(j==2){

			printf("Yes");

			return 0;

		}

	}

	

	printf("No");

	return 0;

	

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

#include <iostream>

#include <cmath>

#include <algorithm>



using namespace std;



int main(){

    char c[101];

    cin>>c;

    //

    bool cFound = false, fFound = false;

    

    for(int i = 0;c[i] != '\0';i++){

        if(c[i] == 'C' && !fFound) cFound = true;

        if(c[i] == 'F' && cFound) fFound = true;

    }

    if(cFound && fFound) cout<<"Yes";

    else cout<<"No";

}

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

#include<cstring>

using namespace std;

const int MAXN=10005;

char Str1[MAXN],Str2[MAXN];

int Len1,Len2;



int main(){

	scanf("%s",Str1);

	Len1=strlen(Str1);

	Str2[0]='C';

	Str2[1]='F';

	Len2=2;

	int j=0;

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

	if(Str1[i]==Str2[j]){

		j++;

		if(j==2){

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

#include<cstring>

using namespace std;

const int MAXN=10005;

char Str1[MAXN],Str2[MAXN];

int Len1,Len2;



int main(){

	scanf("%s",Str1);

	Len1=strlen(Str1);

	Str2[0]='C';

	Str2[1]='F';

	Len2=2;

	int j=0;

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

	if(Str1[i]==Str2[j]){

		j++;

		if(j==2){

			printf("Yes");

			return 0;

		}

	}

	

	printf("No");

	return 0;

	

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

using namespace std;

char cf[111];



int main(){

    scanf("%s",cf);

    bool c=false,f=false;

    int l=strlen(cf);

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

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

        c=true;

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

        f=true;}

    if(c&&f)printf("Yes");

    else printf("No");

    return 0;}

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

#include<cstring>

using namespace std;

const int MAXN=10005;

char Str1[MAXN],Str2[MAXN];

int Len1,Len2;



int main(){

	scanf("%s",Str1);

	Len1=strlen(Str1);

	Str2[0]='C';

	Str2[1]='F';

	Len2=2;

	int j=0;

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

	if(Str1[i]==Str2[j]){

		j++;

		if(j==2){

			printf("Yes");

			return 0;

		}

	}

	

	printf("No");

	return 0;

	

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

using namespace std;

char a[10010]; 

bool c, f;

int main() {

    scanf("%s", a);

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

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

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

    }

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

    else cout<<"No\n";

    return 0;

}

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

#include<cstring>

using namespace std;

const int MAXN=10005;

char Str1[MAXN],Str2[MAXN];

int Len1,Len2;



int main(){

	scanf("%s",Str1);

	Len1=strlen(Str1);

	Str2[0]='C';

	Str2[1]='F';

	Len2=2;

	int j=0;

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

	if(Str1[i]==Str2[j]){

		j++;

		if(j==2){

			printf("Yes");

			return 0;

		}

	}

	

	printf("No");

	return 0;

	

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

#include<cstdio>

using namespace std;

int main()

{

	int i;

	string s;

	cin>>s;

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

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

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

#include<cstring>

using namespace std;

const int MAXN=10005;

char Str1[MAXN],Str2[MAXN];

int Len1,Len2;



int main(){

	scanf("%s",Str1);

	Len1=strlen(Str1);

	Str2[0]='C';

	Str2[1]='F';

	Len2=2;

	int j=0;

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

	if(Str1[i]==Str2[j]){

		j++;

		if(j==2){

			printf("Yes");

			return 0;

		}

	}

	

	printf("No");

	return 0;

	

}
// 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.320985884630028x):
#include<cstdio>

#include<cstring>

using namespace std;

const int MAXN=10005;

char Str1[MAXN],Str2[MAXN];

int Len1,Len2;



int main(){

	scanf("%s",Str1);

	Len1=strlen(Str1);

	Str2[0]='C';

	Str2[1]='F';

	Len2=2;

	int j=0;

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

	if(Str1[i]==Str2[j]){

		j++;

		if(j==2){

			printf("Yes");

			return 0;

		}

	}

	

	printf("No");

	return 0;

	

}
// Slower C++ solution:
// ==============================

//  author: memset0

//  website: https://memset0.cn

//  date: 2018.08.06 14:06:24

// ==============================

#include <bits/stdc++.h>

#define ll long long

using namespace std;



int len;

char s[110];



int main() {

	scanf("%s", s), len = strlen(s);

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

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

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

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

					printf("Yes\n");

					return 0;

				}

	printf("No\n");

	return 0;

}

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

#include<cstring>

using namespace std;

const int MAXN=10005;

char Str1[MAXN],Str2[MAXN];

int Len1,Len2;



int main(){

	scanf("%s",Str1);

	Len1=strlen(Str1);

	Str2[0]='C';

	Str2[1]='F';

	Len2=2;

	int j=0;

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

	if(Str1[i]==Str2[j]){

		j++;

		if(j==2){

			printf("Yes");

			return 0;

		}

	}

	

	printf("No");

	return 0;

	

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

using namespace std;

char S[110];

int main()

{

	scanf("%s",S);

	int l=strlen(S);

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

	{

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

		{

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

			{

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

				{

					printf("Yes\n");

					return 0;

				}

			}

		}

	}

	printf("No\n");

	return 0;

}

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

#include<cstring>

using namespace std;

const int MAXN=10005;

char Str1[MAXN],Str2[MAXN];

int Len1,Len2;



int main(){

	scanf("%s",Str1);

	Len1=strlen(Str1);

	Str2[0]='C';

	Str2[1]='F';

	Len2=2;

	int j=0;

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

	if(Str1[i]==Str2[j]){

		j++;

		if(j==2){

			printf("Yes");

			return 0;

		}

	}

	

	printf("No");

	return 0;

	

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

using namespace std;

string s;

int l;

int main()

{

    cin>>s;

    l=s.size();

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

    {

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

        {

            for(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.320199336873714x):
#include<cstdio>

#include<cstring>

using namespace std;

const int MAXN=10005;

char Str1[MAXN],Str2[MAXN];

int Len1,Len2;



int main(){

	scanf("%s",Str1);

	Len1=strlen(Str1);

	Str2[0]='C';

	Str2[1]='F';

	Len2=2;

	int j=0;

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

	if(Str1[i]==Str2[j]){

		j++;

		if(j==2){

			printf("Yes");

			return 0;

		}

	}

	

	printf("No");

	return 0;

	

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

char a[10010]; 

bool c, f; 

int main() {

    scanf("%s", a); 

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

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

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

    }

    if(f==true) printf("Yes\n"); 

    else printf("No\n"); 

    return 0;

}

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

#include<cstring>

using namespace std;

const int MAXN=10005;

char Str1[MAXN],Str2[MAXN];

int Len1,Len2;



int main(){

	scanf("%s",Str1);

	Len1=strlen(Str1);

	Str2[0]='C';

	Str2[1]='F';

	Len2=2;

	int j=0;

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

	if(Str1[i]==Str2[j]){

		j++;

		if(j==2){

			printf("Yes");

			return 0;

		}

	}

	

	printf("No");

	return 0;

	

}