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;
const int INF = 2147380000;
const long long inf = 1e18;
const int maxn = 200;
map<string, int> ms;
int n;
string ans;
int Max;
char s[maxn];
int main() {
  while (scanf("%d", &n) != EOF) {
    scanf(" %s", s);
    ms.clear();
    Max = -1;
    for (int i = 0; i < n - 1; i++) {
      char S[5];
      S[0] = s[i];
      S[1] = s[i + 1];
      S[2] = '\0';
      string ss = (string)S;
      if (ms.count(ss)) {
        ms[ss]++;
      } else {
        ms[ss] = 1;
      }
    }
    for (int i = 0; i < n - 1; i++) {
      char S[5];
      S[0] = s[i];
      S[1] = s[i + 1];
      S[2] = '\0';
      string ss = (string)S;
      if (ms[ss] > Max) {
        Max = ms[ss];
        ans = ss;
      }
    }
    cout << ans << endl;
  }
  return 0;
}
