PROGRAMMING:Inserting data into an ordered list

Given a batch of integer data with strictly increasing permutation and given an X, if X does not exist, then x is inserted, and it is required to keep order after insertion. If it exists, no operation is required.
###Input format:
There are two lines of input:
The first number is n value, which means there are n data in the linked list. Then there are n numbers, representing n data.
The second line is the number to insert.
###Output format:
Output the inserted linked list data, separated by spaces. There must be no extra spaces at the end of the line.
###Input sample 1:
Here is a set of inputs. For example:
```in
5 1 3 6 9 11
four
```
###Output sample 1:
The corresponding output is given here. For example:
```out
1 3 4 6 9 11
```
###Input sample 2:
Here is a set of inputs. For example:
```in
5 1 3 6 9 11
three
```
###Output sample 2:
The corresponding output is given here. For example:
```out
1 3 6 9 11
```







answer：If there is no answer, please comment