{"problem":{"name":"NewFolder(1)","description":{"content":"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 $i=1, \\ldots, N","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc261_c"},"statements":[{"statement_type":"Markdown","content":"For two strings $A$ and $B$, let $A+B$ denote the concatenation of $A$ and $B$ in this order.\nYou are given $N$ strings $S_1,\\ldots,S_N$. Modify and print them as follows, in the order $i=1, \\ldots, N$:\n\n*   if none of $S_1,\\ldots,S_{i-1}$ is equal to $S_i$, print $S_i$;\n*   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.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2\\times 10^5$\n*   $S_i$ is a string of length between $1$ and $10$ (inclusive) consisting of lowercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$S_1$\n$S_2$\n$\\vdots$\n$S_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc261_c","tags":[],"sample_group":[["5\nnewfile\nnewfile\nnewfolder\nnewfile\nnewfolder","newfile\nnewfile(1)\nnewfolder\nnewfile(2)\nnewfolder(1)"],["11\na\na\na\na\na\na\na\na\na\na\na","a\na(1)\na(2)\na(3)\na(4)\na(5)\na(6)\na(7)\na(8)\na(9)\na(10)"]],"created_at":"2026-03-03 11:01:14"}}