- Time limit: 1.00 s
- Memory limit: 512 MB
What is the final string?
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$.
Print the final string.
- $0 \le n \le 10^6$