Codeforces Round #230 (Div. 2)A. Nineteen

A. Nineteen

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 test(s)

input

nniinneetteeeenn

output

2

input

nneteenabcnneteenabcnneteenabcnneteenabcnneteenabcii

output

2

input

nineteenineteen

output

2

解题报告：

此题为思维题。求可以凑成nineteen最大个数，可以重复使用。这样就是n可以作为重复使用。那么找下规律

nineteen n：3 sum：1

nineteenineteen n： 5 sum：2

nineteenineteenineteen n： 7 sum：3

所以规律如下

n--;n/=2;e/=3;然后min(n,i,t,e)即可。

代码如下：

#include <iostream>
#include <cstdio>
#include <string>
using namespace std;

string s;
int main(){
    int n,i,t,e;
    n=i=t=e=0;
    cin>>s;
    for(int j=0;j<s.length();j++){
        if(s[j]=='n')
            n++;
        else if(s[j]=='i')
            i++;
        else if(s[j]=='t')
            t++;
        else if(s[j]=='e')
            e++;
    }
    n--;e/=3;n/=2;
    printf("%d\n",min(min(n,i),min(t,e)));
    return 0;
}