Smallest by Deleting One Digit

You are given a string s consisting of digits. Your task is to remove exactly one digit from s so that the resulting number (when the remaining digits are interpreted as an integer) is the smallest possible. For example, if s = "261537", removing the digit '6' yields 21537, which is the smallest possible outcome.

You can express the problem mathematically as follows: Given a string \( s \) of length \( n \), find \[ \min_{0 \leq i < n} \; \text{int}(s[0:i] + s[i+1:n]) \] where int() is the function converting a string to an integer.

Note that if the removal causes leading zeros, they should be ignored when interpreting the number.

inputFormat

The input consists of a single line containing a non-empty string s of digits.

outputFormat

Output the smallest possible integer obtained by deleting exactly one digit from the input string.

261537

21537