|
Matcom Online Grader
Faculty of Mathematics and Computer Science of University of Havana
ℹ️ We've recently migrated MOG to a new server with a different grader. As a result, some features—especially those related to submission evaluation—might not work correctly. If you encounter any issues, please report them by clicking the exclamation icon in the bottom right corner of the website.
Fito lost a game of chess to Nina so he found comfort in competitive programming. Very soon, he heard of ICPC programming contests and decided to try his luck there.
He wrote a mail to Mario: “Dear Mario, please, prepare me for ICPC. Fito”.
Mario replied: “You want to participate in ICPC? All right, here's your warm-up task. A series of four
consecutive letters of some word that make up the subword “HONI” is
called the HONI-block. I will send you the word of length N and you will throw out as many letters as
you want (it might be none as well) so that in the end there are as many HONI-blocks as possible in
the word. Mario”.
Fito was very worried and asked you for help. Help him determine the
maximum number of HONI-blocks he can get in the final word.
Input
The first line contains a word of length N (1≤N≤100000) , consisting of uppercase letters of the
English alphabet
Output
In the first and only line print out the required number of HONI-blocks
Sample test(s)
Input
MAGNUS
Output
0
Input
HHHHOOOONNNNIIII
Output
1
Input
PROHODNIHODNIK
Output
2
Hints
Explanation of the second sample test:
By throwing out three letters ‘H’, ‘O’, ‘N’ or ‘I’ Fito can get the word “HONI”, which contains one HONI-block