Problem Description

JOI-kun found a string $ S $ of length $ N $. All characters in $ S $ are lowercase English letters.

JOI-kun decided to find all consecutive occurrences of his name joi in the string starting from the beginning. Each time he finds joi, he will replace it with the uppercase JOI for emphasis.

Given the string $ S $, create a program that outputs the string $ S $ with all occurrences of joi replaced with JOI.

Input Format

The input is given from the standard input in the following format:

$ N $ $ S $

Output Format

Output the string $ S $ with all occurrences of joi replaced with JOI in one line.

Sample Input and Output

Sample Input #1

11
joinojoijin

Sample Output #1

JOInoJOIjin

Sample Input #2

16
jjooiiijoiojioij

Sample Output #2

jjooiiiJOIojioij

Sample Input #3

13
nihongoutenai

Sample Output #3

nihongoutenai

Notes/Hints

Constraints

• $3 \leq N \leq 100$.
• $ S $ is a string of length $ N $.
• $ S $ consists of lowercase English letters.

Sample Explanation 1

Replace joi from the 1st to the 3rd character and from the 6th to the 8th character with JOI.

Sample Explanation 3

Note that $ S $ may not contain any joi at all.

见题面 Input 部分

见题面 Output 部分