PROGRAMMING:Exchange minimum
This problem requires programming to find out the minimum value of the given number of $$n $, exchange it with the first number, and finally output the sequence after exchange. The minimum is unique.
###Input format:
Input in the first line gives a positive integer $$n $$($$1 / Le n / Le 10 $$) and in the second line gives $$n $$integers separated by spaces.
###Output format:
Output the exchanged sequence in a row, each integer followed by a space.
###Input example:
```in
five
8 2 5 1 4
```
###Output example:
```out
1 2 5 8 4
```
answer：If there is no answer, please comment
###Input format:
Input in the first line gives a positive integer $$n $$($$1 / Le n / Le 10 $$) and in the second line gives $$n $$integers separated by spaces.
###Output format:
Output the exchanged sequence in a row, each integer followed by a space.
###Input example:
```in
five
8 2 5 1 4
```
###Output example:
```out
1 2 5 8 4
```
answer：If there is no answer, please comment