#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#define endl '\n'
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define rep2(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
template<typename... Args>
void bubu(Args... args) { cout << ":: "; ((cout << args << " "), ...); cout << endl; }
void bubu(vector<int> tem) { for (auto x : tem) cout << x << ' '; cout << endl; }
void kuaidu() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); }
inline int max(int a, int b) { if (a < b) return b; return a; }
inline int min(int a, int b) { if (a < b) return a; return b; }
using PII = pair<int, int>;
using i128 = __int128;

//=======================================================================
const int N = 1e5 + 10;
const int M = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 1e16;
int n, m, T;
vector<char> A;
map<char, int> mp;
map<char, int> mp2;
int rk[N];
//=======================================================================

signed main() {
	kuaidu();
	cin >> n;
	string s; cin >> s;
	priority_queue<string> F;
	string tem;

	rep(i, 0, n - 1) {
		map<char, int> mp3;
		if (!mp[s[i]]) A.push_back(s[i]);
		tem.push_back(s[i]);
		mp[s[i]] += 1;
		mp2[s[i]] = i;
		sort(A.begin(), A.end(), [&](char a, char b) {
			if (mp[a] == mp[b]) return mp2[a] > mp2[b];
			return mp[a] > mp[b];
			});
		int cnt = 0;
		for (auto x : A) {
			mp3[x] = ++cnt;
		}

		string l1 = tem;
		for (auto& x : l1) {
			x = char(mp3[x] + 'a' - 1);
		}
		F.push(l1);
	}
	cout << F.top() << endl;
	return 0;
}