407127: GYM102697 098 It's More Fun To Compute

It's More Fun To Compute

You are trying to discover that it's more fun to compute, and you're doing so by evaluating long strings of text. You define the fun-ness of a string to be the amount of characters in the string that are equal to "f", "u", and "n". You can perform cyclic shifts on the string an infinite number of times. When you cyclically shift the string, each character changes into the one after it, so any "a" characters become "b", "b" becomes "c", etc. "z" characters turn into "a" in a cyclic shift.

Given that you can perform an infinite number of cyclic shifts on the input string, find the maximum fun-ness of the string.

The only line of input contains a single string $$$s$$$, consisting of only lowercase a-z characters and spaces. (When you perform a cyclic shift on the string, nothing happens to the spaces).

Output a single positive integer $$$n$$$: the maximum possible fun-ness of the string, as described above.

hello world

5

coderams contest number eight

9