CodeForces 977B Two-gram 水题

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 ss consisting of nn 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 ss = "BBAABBBA" the answer is two-gram "BB", which contained in ss 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 nn (2≤n≤1002≤n≤100) — the length of string ss. The second line of the input contains the string ss consisting of nn capital Latin letters.

Output

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

Examples

Input

7
ABACABA

Output

AB

Input

5
ZZZAA

Output

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.

给你一个字符串，找出现次数最多的长度为2的子串。

AC代码：

#include <iostream>
#include <string>
#include <cstring>
using namespace std;

int main()
{
    int n;
    while(cin>>n)
    {
        int map[30][30]={0};
        string s;
        cin>>s;
        int maxx=0;
        int  maxs;
        for(int i=0;i<s.size()-1;i++)
        {
            map[s[i]-'A'][s[i+1]-'A']++;
            if(map[s[i]-'A'][s[i+1]-'A']>maxx)
            {
                maxx=map[s[i]-'A'][s[i+1]-'A'];
                maxs=i;
            }
        }
        cout<<s[maxs]<<s[maxs+1]<<endl;
    }

    return 0;
}