eolymp
bolt
Try our new interface for solving problems
Problems

First and last appearance

First and last appearance

Given a string of letters. If the letter f appears only once, print its index (indexes are numbered starting from 0).

If the letter f appears two or more times, print the index of the first and of the last appearance.

If letter f is not found in the given string, print nothing.

Input

One string of no more than 255 letters.

Output

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

Time limit 1 second
Memory limit 128 MiB
Input example #1
comfort
Output example #1
3
Input example #2
office
Output example #2
1 2