## Algorithm

B. Two-gram
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Two-gram is an ordered pair (i.e. string of length two) of capital Latin letters. For example, "AZ", "AA", "ZA" — three distinct two-grams.

You are given a string s consisting of n capital Latin letters. Your task is to find any two-gram contained in the given string as a substring (i.e. two consecutive characters of the string) maximal number of times. For example, for string s = "BBAABBBA" the answer is two-gram "BB", which contained in s three times. In other words, find any most frequent two-gram.

Note that occurrences of the two-gram can overlap with each other.

Input

The first line of the input contains integer number n (2n1002≤�≤100) — the length of string s. The second line of the input contains the string s consisting of n capital Latin letters.

Output

Print the only line containing exactly two capital Latin letters — any two-gram contained in the given string s as a substring (i.e. two consecutive characters of the string) maximal number of times.

Examples
input
Copy
7ABACABA
output
Copy
AB
input
Copy
5ZZZAA
output
Copy
ZZ
Note

In the first example "BA" is also valid answer.

In the second example the only two-gram "ZZ" can be printed because it contained in the string "ZZZAA" two times.

## Code Examples

### #1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int n, best, cur;
string s, res;

int main() {
cin >> n >> s;

for(char c1 = 'A'; c1 <= 'Z'; ++c1)
for(char c2 = 'A'; c2 <= 'Z'; ++c2) {
cur = 0;
for(int i = 1; i < n; ++i)
cur += (c1 == s[i-1] && c2 == s[i]);
if(cur > best) {
best = cur;
res = "";
res += c1;
res += c2;
}
}

cout << res << endl;

return 0;
}
Copy The Code &

Input

cmd
7
ABACABA

Output

cmd
AB