{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$ of length $N$.\nFind the string obtained by replacing all contiguous occurrences of `na` in $S$ with `nya`."},{"iden":"constraints","content":"*   $N$ is an integer between $1$ and $1000$, inclusive.\n*   $S$ is a string of length $N$ consisting of lowercase English letters."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$\n$S$"},{"iden":"sample input 1","content":"4\nnaan"},{"iden":"sample output 1","content":"nyaan\n\nReplacing all contiguous occurrences of `na` in `naan` with `nya` results in the string `nyaan`."},{"iden":"sample input 2","content":"4\nnear"},{"iden":"sample output 2","content":"near\n\n$S$ may not contain a contiguous `na`."},{"iden":"sample input 3","content":"8\nnational"},{"iden":"sample output 3","content":"nyationyal"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}