Problem

Write a program that finds how many places in a given string have $3$ consecutive characters arranged as JOI or IOI, respectively. The string consists only of uppercase English letters. For example, in JOIOIOI as shown in the figure below, JOI is included in $1$ place and IOI is included in $2$ places.

Input

The input consists of $1$ line and includes $1$ string of uppercase English letters with a length of at most $10000$.

Output

The output consists of $2$ lines: output the number of JOI found on the $1$-st line, and the number of IOI found on the $2$-nd line.

Sample Input and Output

Sample Input 1

JOIJOI

Sample Output 1

2
0

Sample Input 2

JOIOIOIOI

Sample Output 2

1
3

Sample Input 3

JOIOIJOINXNXJIOIOIOJ

Sample Output 3

2
3