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;
char s[105];
int cnt[105];
int main() {
  int n;
  while (cin >> n) {
    memset(cnt, 0, sizeof(cnt));
    for (int i = 0; i < n; ++i) cin >> s[i];
    for (int i = 0; i < n - 1; ++i) {
      for (int j = 0; j < n - 1; ++j)
        if (s[i] == s[j] && s[i + 1] == s[j + 1]) ++cnt[i];
    }
    int max = -1;
    string ans;
    for (int i = 0; i < n; ++i) {
      if (cnt[i] > max) {
        max = cnt[i];
        ans = "";
        ans += s[i];
        ans += s[i + 1];
      }
    }
    cout << ans << endl;
  }
}
