B. We're Competing
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

The year is 2077 and you are a renowned archaeologist specializing in ancient texts. Recently, you came across a scroll that appears to be a transcript of an extremely important interview for the course of human civilization. To confirm your suspicions, you ask ChatGPT for help!

You received a transcription of the scroll made by ChatGPT, but it came without spaces and is very hard to read! Furthermore, since you don't have the PRO plan, the AI may have made up to $$$K$$$ mistakes, that is, it may have changed up to $$$K$$$ characters.

All you know about the text you are looking for is that it contains the phrase "tamo competindo", and you are too impatient to ask another AI for a transcription. Therefore, given the factor $$$K$$$ and the transcription from ChatGPT, determine if it is possible that the original scroll matches the text you are looking for, i.e., if it is possible that it originally contained the phrase "tamo competindo".

Input

The first line of input contains a single integer $$$K \; (1 \leq K \leq 14)$$$

The second line of input contains a sequence of characters $$$S \; (1 \leq |S| \leq 5 \cdot 10^4)$$$

Output

If it is possible that the input text is the desired text, print SIM (portuguese for YES). Otherwise, print NAO (portuguese for NO).

Examples
Input
3
tepoassimtamocompetindu
Output
SIM
Input
1
temocompetindu
Output
NAO
Input
14
olaaaa
Output
NAO
Input
3
tamoccompetindo
Output
NAO
Input
10
acreditenosseussonhos
Output
SIM
Note

Explanation of example $$$1$$$: It is possible that the original text was "tipo assim tamo competindo". Since this text contains the phrase "tamo competindo", it is a valid text. To become the version given in the input, ChatGPT could have made mistakes in the second and last letters, making $$$2$$$ of the $$$3$$$ possible mistakes. Thus, the text became "tepo assim tamo competindu". When delivered without spaces, it became "tepoassimtamocompetindu", just like in the input.

Explanation of example $$$2$$$: It is possible to show that it is impossible for this to be the desired text. Note that if $$$K$$$ were greater than or equal to $$$2$$$, the answer would be SIM.