<? echo $row['title']." - ".$MSG_PROBLEM."

Time Limit: 2 sec / Memory Limit: 1024 MB

Score :

300

points

For two strings

A

and

B

, let

A + B

denote the concatenation of

A

and

B

in this order.
You are given

N

strings

S_1,\ldots,S_N

. Modify and print them as follows, in the order

\ldots, N

if none of $S_1,\ldots,S_{i-1}$ is equal to $S_i$ , print $S_i$ ;
if $X$ $(X > 0)$ of $S_1,\ldots,S_{i-1}$ are equal to $S_i$ , print $S_i+$ ( $+ X +$ ), treating $X$ as a string.

$\leq N \leq 2\times 10^5$
$S_i$ is a string of length between $1$ and $10$ (inclusive) consisting of lowercase English letters.

Input is given from Standard Input in the following format:

 $N$  $S_1$  $S_2$  $\vdots$  $S_N$

N

lines as specified in the Problem Statement.