Source

This problem is adapted from Long Long OJ. All rights reserved.

Problem Description

Given a string $s$ consisting only of the characters $\tt{G,J,g,j}$, count the number of occurrences of the substring $\tt{gj}$ (case-sensitive).

Input Format

A single line containing the string $s$ ($1\le|s|\le 10$).

Output Format

Let the answer be $ans$. If $ans\neq 0$, then $f(ans)$ is defined as the result of concatenating $1$ and $ans-1$ into a single number (if any digit in this number is $0$, that digit is ignored). Otherwise (when $ans=0$), $f(ans)=0$. Output $f(ans)$. For example:

• If $ans=1$, $f(ans)=1$ (the $0$ in $10$ is ignored).
• If $ans=5$, $f(ans)=14$.
• If $ans=11$, $f(ans)=11$ (the $0$ in $110$ is ignored).

Samples

Gj

0

ggj

1