PivotOJ

Array of Discord

시간 제한: 1000ms메모리 제한: 1024MB출처: NCPC 2020BOJ 21047

문제

Once upon a time, high up on Mount Olympus, it came to pass that the gods held a competition to see who among them was the best at sorting lists of integers.  Eris, the goddess of discord, finds this terribly boring and plans to add some mischief to the mix to make things more fun.  She will sabotage the answers of Zeus so that his list of numbers is no longer sorted, which will no doubt be so embarrassing that he becomes furious and starts a minor war.

Eris must be careful not to be discovered while performing her sabotage, so she decides to only change a single digit in one of the numbers in Zeus' answer.  The resulting number may not have any leading zeros (unless it becomes equal to zero in which case a single zero digit is allowed).  Eris can only replace a digit with another digit -- adding or removing digits is not allowed.

입력

The first line of input contains nn (2n1002 \leq n \leq 100), the length of Zeus' answer.  The second line contains nn integers a1,a2,,ana_1, a_2, \ldots, a_n (0a1a2an10150 \leq a_1 \le a_2 \le \ldots \le a_n \leq 10^{15}), Zeus' answer.

출력

If Eris can make the list not be sorted by changing a single digit of one of the numbers, then output nn integers b1,,bnb_1, \ldots, b_n, the resulting list of numbers after making the change.  Otherwise, output "impossible".  If there are many valid solutions, any one will be accepted.

예제

예제 1

입력
3
2020 2020 2020
출력
2021 2020 2020

예제 2

입력
2
1 9999999
출력
impossible

예제 3

입력
4
1 42 4711 9876
출력
1 42 4711 3876
이 문제는 채점 준비 중입니다. 테스트 데이터가 확보되면 제출이 가능합니다.