import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] a = new int[n];
		for (int i = 0; i < n; ++i) {
			a[i] = sc.nextInt();
		}
		int max = -1;
		for (int i = 0; i < n; ++i) {
			max = Math.max(i, a[i]);
		}
		boolean f = (a[n - 1] == max);
		Arrays.sort(a);
		if (f) {
			int d = a[n - 1];
			a[n - 1] = a[n - 2];
			a[n - 1] = d;
		}
		for (int i = 0; i < n; ++i) {
			System.out.print(a[i] + (i == n - 1 ? "\n" : " "));
		}
	}

	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}