B. Two-gram

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

Copy

7
ABACABA

output

Copy

AB

input

Copy

5
ZZZAA

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.

代码：

#include <iostream>
#include <cstdio>

using namespace std;

int main()
{
    int n;
    scanf("%d",&n);
    char a[105];
    int b[105];
    int c[30][30]={0};

    scanf("%s",a+1);
    for(int i=1;i<=n;++i)
        b[i]=a[i]-'A';
    for(int i=1;i<n;++i)
    {
        int x=b[i];
        int y=b[i+1];
        c[x][y]++;
    }
    int an1=0,an2=0;
    for(int i=0;i<=25;++i)
    {
         for(int j=0;j<=25;++j)
        {
            if(c[i][j]>c[an1][an2])
            {
                an1=i;
                an2=j;
            }
        }
    }
    //cout<<an1<<" "<<an2<<endl;
    cout<<char(an1+'A')<<char('A'+an2)<<endl;
    return 0;
}