CF393A.Nineteen

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

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

输出格式

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

输入输出样例

输入#1
```
nniinneetteeeenn
```
输出#1
```
2
```

输入#2

nneteenabcnneteenabcnneteenabcnneteenabcnneteenabcii

输出#2

输入#3
```
nineteenineteen
```
输出#3
```
2
```

首页