Disha has a string . In one second, Disha can choose a subsequence from that make the word “code” and remove it from the string. The process will be continued until she can't choose a subsequence that make the word.
In this problem, Good letter means [c,d,e,o]. And others letters are Bad.
Now, you have to find the maximum number of seconds Disha will work.
The first line of the input contains a single integer - the length of the string .
Next line contains string . the string consists of only lowercase English letters.
Number of good letters
Output the maximum number of seconds Disha will work.
Login to submit