15
MIRZOYANOVECLOX
 23
AABBBAAACCCCCAAADDDDDDD
 2
QA
 11
GGRRAATTZZZ
 6
AZAZAZ
 10
SQSQSQSQTG
 3
KEK
 100
URXCAIZFIBNJTPCZHBQIBCILLPXZCFGMKKZMNPLCYGAVJVIBMCZEBSJWPSCPQDYCTTKPOKIJRSKIZPDGCHVOUTMPNECYORSFZFNC
 3
LOL
 2
WW
 8
PUTINVOR
 26
QWERTYUIOPASDFGHJKLZXCVBNM
 5
AZAZA
 9
EGORLETOV
 7
KADUROV
 9
MIKEPIDOR
 9
AAAAAAAAA
 100
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
 5
FUFEL
 50
NYQAHBYYOXLTRYQDMVENEMAQNBAKGLGQOLXNAIFNQTOCLNNQIA

MI
 DD
 QA
 ZZ
 AZ
 SQ
 KE
 IB
 LO
 WW
 PU
 QW
 AZ
 EG
 KA
 MI
 AA
 AA
 FU
 YQ

#include <bits/stdc++.h>
using namespace std;
int m[28][28];
char s[103];
int maxi, maxj;
int main() {
  int n;
  scanf("%d", &n);
  getchar();
  scanf("%c", &s[0]);
  for (int i = 1; i < n; i++) {
    scanf("%c", &s[i]);
    ++m[(int)s[i - 1] - (int)'A'][(int)s[i] - (int)'A'];
  }
  for (int i = 0; i < 28; i++)
    for (int j = 0; j < 28; j++)
      if (m[i][j] > m[maxi][maxj]) {
        maxi = i;
        maxj = j;
      }
  cout << (char)(maxi + (int)'A') << (char)(maxj + (int)'A');
  return 0;
}
