You start with the string "HIIT" and then expand the string by doing a sequence of moves. On each move, you choose a letter "H", "I" or "T", and replace each occurrence of that letter with the string "HIIT".

What is the final string?

Input

The first input line has an integer $n$: the number of moves.

After this there are $n$ lines that describe the moves. Each move is "H", "I" or "T".

You can assume that the length of the final string will be at most $10^6$.

Output

Print the final string.

Constraints

• $0 \le n \le 10^6$

Example

Input:

2
I
H

Output:

HIITHIITIITHIITIITT