Nineteen

1000ms

262144K

Description:

Alice likes word "nineteen" very much. She has a string s and wants the string to contain as many such words as possible. For that reason she can rearrange the letters of the string.

For example, if she has string "xiineteenppnnnewtnee", she can get string "xnineteenppnineteenw", containing (the occurrences marked) two such words. More formally, word "nineteen" occurs in the string the number of times you can read it starting from some letter of the string. Of course, you shouldn't skip letters.

Help her to find the maximum number of "nineteen"s that she can get in her string.

Input:

The first line contains a non-empty string s, consisting only of lowercase English letters. The length of string s doesn't exceed 100.

Output:

Print a single integer — the maximum number of "nineteen"s that she can get in her string.

Sample Input:

nniinneetteeeenn

Sample Output:

Sample Input:

nneteenabcnneteenabcnneteenabcnneteenabcnneteenabcii

Sample Output:

Sample Input:

nineteenineteen

Sample Output:

Informação

Provedor Codeforces

Código CF393A