Chef and Secret Password
All submissions for this problem are available.###Read problems statements in [Hindi](http://www.codechef.com/download/translated/COOK103/hindi/SECPASS.pdf), [Mandarin Chinese](http://www.codechef.com/download/translated/COOK103/mandarin/SECPASS.pdf), [Russian](http://www.codechef.com/download/translated/COOK103/russian/SECPASS.pdf), [Vietnamese](http://www.codechef.com/download/translated/COOK103/vietnamese/SECPASS.pdf) and [Bengali](http://www.codechef.com/download/translated/COOK103/bengali/SECPASS.pdf) as well. Chef wants to prepare a special dish. There is a special ingredient Chef needs for this dish, so he decided to search for it in all of Chefland. After some research, he discovered it in a secret cave. He may only enter the cave if he has a password; fortunately, a string $S$, which serves as a hint for this password, is written next to the cave. Chef knows that the secret password is a non-empty prefix of the string $S$. Also, he knows that: - if a prefix occurs in $S$ more often as a substring, then the probability that this prefix is the secret password is higher (the probability that a chosen prefix is the secret password is an increasing function of its number of occurrences in $S$) - if two prefixes have the same number of occurrences in $S$, then the longer prefix has a higher probability of being the secret password Chef wants to guess the secret password with the maximum possible probability of success. Help Chef and find the prefix for which this probability is maximum. ### Input - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - The second line contains a single string $S$ with length $N$. ### Output For each test case, print a single line containing one string — the prefix with the highest probability of being the secret password. ### Constraints - $1 \le T \le 100$ - $1 \le N \le 100,000$ - $S$ contains only lowercase English letters ### Example Input ``` 3 3 abc 5 thyth 5 abcbc ``` ### Example Output ``` abc th abcbc ``` ### Explanation **Example case 1:** Each prefix occurs in $S$ the same number of times (once) and the prefix with maximum length is "abc", so the secret password is most likely "abc".
|Tags||cook103, easy, shivamgor498|
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.