|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||5||4||4||80.000%|
You are teaching kindergarten! You wrote down the numbers from $1$ to $n$, in order, on a whiteboard. When you weren’t paying attention, one of your students erased one of the numbers.
Can you tell which number your mischievous student erased?
The first line of input contains a single integer $n$ ($2 \le n \le 100$), which is the number of numbers that you wrote down.
The second line of input contains a string of digits, which represents the numbers you wrote down (minus the one that has been erased). There are no spaces in this string. It is guaranteed to contain all of the numbers from $1$ to $n$, in order, except for the single number that the student erased.
Output a single integer, which is the number that the tricky student erased.