Welcome to ZOJ
Information
Problems
Runs
Statistics
Ranklist
Clarification
76 - ZOJ 7th Anniversary Contest - E
The Hidden 7's

Time Limit: 1 Second      Memory Limit: 32768 KB

Given a string of characters, you may find that the word "seven" is hidden inside. For example, in the string "sesveven", five 7's are hidden:

sesveven
sesveven
sesveven
sesveven
sesveven
Your task is to count the number of different 7's.

Note

Upper-case letters are considered as the same as the lower-case letters.

Input

Each case gives the string in a line. The length of the string is not more than 10000.

Output

For each test cases, output in a line the number of different 7's hidden inside the string. The result will be less than 2^63.

Sample Input

sesveven
seSvevEn

Sample Output

5
5

Author: CHEN, Yue
Source: ZOJ 7th Anniversary Contest
Submit    Status