PROGRAMMING:Simplified insert sort
This problem requires the preparation of procedures, a given integer inserted into the original orderly integer sequence, so that the result sequence is still orderly.
###Input format:
Input the non negative integer n ($$< $$10) in the first line; The second line gives n integers in good order from small to large; The third line gives an integer X.
###Output format:
In one line, output a sequence of integers from small to large after X is inserted, with a space after each number.
###Input example:
```in
five
1 2 4 5 7
three
```
###Output example:
```out
1 2 3 4 5 7
```
answer：If there is no answer, please comment
###Input format:
Input the non negative integer n ($$< $$10) in the first line; The second line gives n integers in good order from small to large; The third line gives an integer X.
###Output format:
In one line, output a sequence of integers from small to large after X is inserted, with a space after each number.
###Input example:
```in
five
1 2 4 5 7
three
```
###Output example:
```out
1 2 3 4 5 7
```
answer：If there is no answer, please comment