D - Two-gram CodeForces - 977B

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 nncapital 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.

题目大意：在字符串中寻找出现次数最对的连续字符对

思路：将连续字符转化成 二维数组储存，双重循环比较，寻找出现次数最多，并记录字符

将数字转化字符输出

This is the code

#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include <iomanip>
#include<list>
#include<map>
#include<queue>
#include<sstream>
#include<stack>
#include<string>
#include<set>
#include<vector>
using namespace std;
#define PI acos(-1.0)
#define EPS 1e-8
#define MOD 1e9+7
#define LL long long
#define ULL unsigned long long     //1844674407370955161
#define INT_INF 0x7f7f7f7f      //2139062143
#define LL_INF 0x7f7f7f7f7f7f7f7f //9187201950435737471
const int dr[]={0, 0, -1, 1, -1, -1, 1, 1};
const int dc[]={-1, 1, 0, 0, -1, 1, -1, 1};
// ios.sync_with_stdio(false);
// 那么cin, 就不能跟C的 scanf，sscanf, getchar, fgets之类的一起使用了。
int num[30][30];
int main()
{
    int n;
    cin>>n;
    string s;
    cin>>s;
    for(int i=0;i<n-1;++i)
    {
        int x=s[i]-'A';
        int y=s[i+1]-'A';
        num[x][y]++;
    }
    int maxn=0;
    int first;
    int second;
    for(int i=0;i<26;++i)
    {
        for(int j=0;j<26;++j)
        {
            if(maxn<num[i][j])
            {
                first=i;
                second=j;
                maxn=num[i][j];
            }
        }
    }
    char s1='A'+first;
    char s2='A'+second;
    cout<<s1<<s2<<endl;
    return 0;
}