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 in C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
class At_CF
{
    static void Main(string[] args)
    {
        K_Cakes();
    }

    //Q.1
    static public void CF()
    {
        String answer = System.Text.RegularExpressions.Regex.IsMatch(Console.ReadLine(), "C.*F", System.Text.RegularExpressions.RegexOptions.IgnoreCase) ? "Yes" : "No";
        Console.Write(answer);
    }

    //Q.2
    static public void K_Cakes()
    {
        String[] a = Console.ReadLine().Split(' ');
        int[] b = Array.ConvertAll(Console.ReadLine().Split(' '),new Converter<String,int>( s => int.Parse(s) ));

        int cake = int.Parse(a[0]);
        int cakeType = int.Parse(a[1]);
        
        List<int> cakeList = new List<int>();
        cakeList.AddRange(b);

        while (cakeList.Count > 1)
        {
            cakeList.Sort();
            cakeList.Reverse();

            cakeList[0] -= 1;
            cakeList[1] -= 1;

            cakeList.Remove(0);
        }

        int answer;
        if (cakeList.Count > 0)
        {
            answer = cakeList[0] > 1 ? cakeList[0]-1 : 0;
        }
        else
        {
            answer = 0;
        }

        Console.WriteLine(answer);



    }
}