原题链接--

https://acs.jxnu.edu.cn/problem/CF4Chttps://acs.jxnu.edu.cn/problem/CF4C

Registration System

 5000ms  65536K

描述：

A new e-mail service "Berlandesk" is going to be opened in Berland in the near future. The site administration wants to launch their project as soon as possible, that's why they ask you to help. You're suggested to implement the prototype of site registration system. The system should work on the following principle.

Each time a new user wants to register, he sends to the system a request with his name. If such a name does not exist in the system database, it is inserted into the database, and the user gets the response OK, confirming the successful registration. If the name already exists in the system database, the system makes up a new user name, sends it to the user as a prompt and also inserts the prompt into the database. The new name is formed by the following rule. Numbers, starting with 1, are appended one after another to name (name1, name2, ...), among these numbers the least i is found so that namei does not yet exist in the database.

译文： 在伯兰一个新的电子邮件服务"Berlandesk"即将在未来开放。现场管理人员希望尽快启动他们的项目,那是为什么他们向你寻求帮助。你的建议是实现现场注册系统的原型。这个系统按照如下原理来运行。

每次一个新的使用者想要登陆，他要递交名字给系统。如果名字不在系统的数据库中，它将被插入到数据库中，然后使用者会得到OK的回应，来认证成功的登陆。如果名字已经存在系统的数据库中，系统将会制造一个新的使用者名字，呈现给使用者作为一个提示并插入这个提示进入数据库中。新名字的形式遵循以下规则。从1开始的数字，一个接一个的附加在名字后面（名字1，名字2,...）,在这些数字中至少i是建立的以至于名字i之前不存在系统的数据库中。

输入：

The first line contains number n (1 ≤ n ≤ 105). The following n lines contain the requests to the system. Each request is a non-empty line, and consists of not more than 32 characters, which are all lowercase Latin letters.

译文：第一行包含数字 n (1 ≤ n ≤ 105)。接下来n行包含系统的请求。每个请求都不是空白行,并由不多于32个字符组成，字符都是小写的拉丁字母。

输出：

Print n lines, which are system responses to the requests: OK in case of successful registration, or a prompt with a new name, if the requested name is already taken.

译文：输出n行，都是对系统请求的回应：成功注册回应OK，否则用一个新名字提示，如果请求的名字已经存在。

样例输入：

4
abacaba
acaba
abacaba
acab

样例输出：

OK
OK
abacaba1
OK

样例输入：

6
first
first
second
second
third
third

样例输出：

OK
first1
OK
second1
OK
third1