Problem Statement

You are given a string S of length N.
Find the string obtained by replacing all contiguous occurrences of na in S with nya.

Input

The input is given from Standard Input in the following format:
N
S

Output

Print the answer.

Constraints

• N is an integer between 1 and 1000, inclusive.
• S is a string of length N consisting of lowercase English letters.

Sample Input 1

4
naan

Sample Output 1

nyaan

Replacing all contiguous occurrences of na in naan with nya results in the string nyaan.

Sample Input 2

4
near

Sample Output 2

near

S may not contain a contiguous na.

Sample Input 3

8
national

Sample Output 3

nyationyal

见题面 Input 部分

见题面 Output 部分