CF1076A.Minimizing the String

You are given a string $s$ consisting of $n$ lowercase Latin letters.

You have to remove at most one (i.e. zero or one) character of this string in such a way that the string you obtain will be lexicographically smallest among all strings that can be obtained using this operation.

String $s = s_1 s_2 \dots s_n$ is lexicographically smaller than string $t = t_1 t_2 \dots t_m$ if $n \lt m$ and $s_1 = t_1, s_2 = t_2, \dots, s_n = t_n$ or there exists a number $p$ such that $p \le min(n, m)$ and $s_1 = t_1, s_2 = t_2, \dots, s_{p-1} = t_{p-1}$ and $s_p \lt t_p$.

For example, "aaa" is smaller than "aaaa", "abb" is smaller than "abc", "pqr" is smaller than "z".

给你一个由 $n$ 个小写拉丁字母组成的字符串 $s$。

你需要至多删除该字符串中的一个字符（即删除零个或一个字符），使得所得字符串在所有通过此操作可能得到的字符串中字典序最小。

字符串 $s = s_1 s_2 \dots s_n$ 的字典序小于字符串 $t = t_1 t_2 \dots t_m$，当且仅当以下条件之一成立：

• $n \lt m$，且 $s_1 = t_1, s_2 = t_2, \dots, s_n = t_n$；
• 或存在某个数 $p$，满足 $p \le \min(n, m)$，且 $s_1 = t_1, s_2 = t_2, \dots, s_{p-1} = t_{p-1}$，同时 $s_p \lt t_p$。

例如，“aaa” 小于 “aaaa”，“abb” 小于 “abc”，“pqr” 小于 “z”。

The first line of the input contains one integer $n$ ($2 \le n \le 2 \cdot 10^5$) — the length of $s$.

The second line of the input contains exactly $n$ lowercase Latin letters — the string $s$.

输入的第一行包含一个整数 $n$（$2 \le n \le 2 \cdot 10^5$）—— 字符串 $s$ 的长度。

输入的第二行恰好包含 $n$ 个小写拉丁字母 —— 字符串 $s$。

Print one string — the smallest possible lexicographically string that can be obtained by removing at most one character from the string $s$.

输出一个字符串——即通过从字符串 $s$ 中最多删除一个字符所能得到的字典序最小的字符串。

In the first example you can remove any character of $s$ to obtain the string "aa".

In the second example "abca" < "abcd" < "abcda" < "abda" < "acda" < "bcda".

在第一个例子中，你可以删除 $s$ 的任意一个字符来得到字符串 "aa"。

在第二个例子中，有 "abca" < "abcd" < "abcda" < "abda" < "acda" < "bcda"。