#include <bits/stdc++.h>
using namespace std;
long long int nCr[2005][2005];
long long int FindnCr(long long int n, long long int k) {
  long long int i, j, mod = 1000000007;
  for (i = 0; i <= n; i++) {
    for (j = 0; j <= min(i, k); j++) {
      if (j == 0 || j == i)
        nCr[i][j] = 1;
      else
        nCr[i][j] = (nCr[i - 1][j - 1] + nCr[i - 1][j]) % 1000000007;
    }
  }
  return nCr[n][k];
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  long long int n;
  cin >> n;
  string s;
  cin >> s;
  long long int a = (long long int)(s[0] - 'a');
  long long int counter = -1;
  for (long long int i = 1; i < n; i++) {
    long long int b = (long long int)(s[i] - 'a');
    if (b < a) {
      counter = i - 1;
      break;
    } else
      a = b;
  }
  if (counter == -1) {
    for (long long int i = 0; i < n - 1; i++) {
      cout << s[i];
    }
  } else {
    for (long long int i = 0; i < n; i++) {
      if (i == counter)
        continue;
      else
        cout << s[i];
    }
  }
  return 0;
}
