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 main() {
  long long n;
  char a[110];
  cin >> n >> a;
  int gram[27][27] = {0};
  for (int i = 0; i < 26; ++i) {
    for (int j = 0; j < 26; ++j) {
      for (int k = 1; a[k] != '\0'; k++) {
        if (a[k - 1] - 'A' == i && a[k] - 'A' == j) {
          gram[i][j]++;
        }
      }
    }
  }
  int big_count = 0;
  int i_index = 0;
  int j_index = 0;
  for (int i = 0; i < 26; ++i) {
    for (int j = 0; j < 26; j++) {
      if (gram[i][j] > big_count) {
        big_count = gram[i][j];
        i_index = i;
        j_index = j;
      }
    }
  }
  cout << (char)(i_index + 'A') << (char)(j_index + 'A');
  return 0;
}
