CF393A.Nineteen

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.

爱丽丝非常喜欢单词“nineteen”。她有一个字符串 $s$，希望该字符串中包含尽可能多的这样的单词。为此，她可以重新排列字符串中的字母。

例如，如果她拥有字符串 "xiineteenppnnnewtnee"，她可以将其重排为 "xnineteenppnineteenw"，其中包含（标出的出现位置）两个这样的单词。更准确地说，单词“nineteen”在字符串中出现的次数，等于你从字符串的某个字母开始、不跳过任何字母、能够完整读出该单词的次数。

请帮她找出她的字符串中最多能包含多少个“nineteen”。

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

第一行包含一个非空字符串 $s$，该字符串仅由小写英文字母组成。字符串 $s$ 的长度不超过 100。

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

输出一个整数——她在字符串中能得到的“nineteen”的最大数量。