#include <bits/stdc++.h>
using namespace std;
int f[150], i, minn;
string s;
int main() {
  cin >> s;
  for (i = 0; i < s.size(); ++i) f[s[i] - 'a']++;
  minn = min((f['n' - 'a'] + f['n' - 'a'] / 2 - 1) / 3, f['e' - 'a'] / 3);
  minn = min(minn, min(f['i' - 'a'], f['t' - 'a']));
  cout << minn;
}

### Prompt

Please formulate a Cpp solution to the following problem:

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.

Examples

Input

nniinneetteeeenn


Output

2

Input

nneteenabcnneteenabcnneteenabcnneteenabcnneteenabcii


Output

2

Input

nineteenineteen


Output

2

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int f[150], i, minn;
string s;
int main() {
  cin >> s;
  for (i = 0; i < s.size(); ++i) f[s[i] - 'a']++;
  minn = min((f['n' - 'a'] + f['n' - 'a'] / 2 - 1) / 3, f['e' - 'a'] / 3);
  minn = min(minn, min(f['i' - 'a'], f['t' - 'a']));
  cout << minn;
}

```