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 n;
void f(int x) {
  if (x == 0) return;
  if (n % 10)
    n -= 1, f(x - 1);
  else
    n /= 10, f(x - 1);
}
int main() {
  int tt = 1;
  while (tt--) {
    int mx = 0;
    vector<string> v;
    map<string, int> freq;
    cin >> n;
    string s;
    cin >> s;
    for (int i = 0; i + 1 < n; i++) {
      string g = "";
      char c1 = s[i], c2 = s[i + 1];
      g.push_back(c1);
      g.push_back(c2);
      freq[g]++;
      mx = max(freq[g], mx);
    }
    for (auto [key, value] : freq) {
      if (value == mx) {
        cout << key << endl;
        return 0;
      }
    }
  }
  return 0;
}
