eolymp
bolt
Try our new interface for solving problems
Problems

Second appearance

Second appearance

Given a string of letters. Find the second appearance of the letter f and print its index (indexes are numbered starting from 0).

If the letter f appears only once, print number -1. If letter f is not found in the given string, print number -2.

Input

One string of letters.

Output

Print the answer depending on how many times the letter f appears in the given string.

Time limit 1 second
Memory limit 122.17 MiB
Input example #1
comfort
Output example #1
-1
Input example #2
coffee
Output example #2
3
Input example #3
qwerty
Output example #3
-2