import java.util.Scanner;
public class HDU_oj2016 {
/*
* 输入n(n<100)个数,找出其中最小的数,将它与最前面的数交换后输出这些数*/
public static void main(String[] args) {
Scanner sn = new Scanner(System.in);
while(sn.hasNext()) {
int n = sn.nextInt();
if(n != 0) {
int[] arr = new int[n];
for(int i = 0;i < n;i++) {
arr[i] = sn.nextInt();
}
modify(arr);
for(int i = 0; i < arr.length-1; i++) {
System.out.print(arr[i]+" ");
}
System.out.println(arr[arr.length-1]);
}
}
}
public static void modify(int[] arr) {
int min = arr[0];
int minIndex = 0;
for(int i = 0; i < arr.length; i++) {
if(min > arr[i]) {
min = arr[i];
minIndex = i;
}
}
if(minIndex != 0) {
int temp = arr[minIndex];
arr[minIndex] = arr[0];
arr[0] = temp;
}
}
}