import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] A = new int[N];
		int[] left = new int[N];
		int[] right = new int[N];
		for(int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
		}
		sc.close();
		// System.out.println("--------");
		// 左からのMAXを保持
		left[0] = A[0];
		// System.out.print(left[0] + " ");
		for(int i = 1; i < N; i++) {
			left[i] = Math.max(left[i - 1], A[i]);
			// System.out.print(left[i] + " ");
		}
		// System.out.println("");
		// 右からのMAXを保持
		right[N - 1] = A[N - 1];
		// System.out.print(right[N - 1] + " ");
		for(int i = N - 2; i >= 0; i--) {
			right[i] = Math.max(right[i + 1], A[i]);
			// System.out.print(right[i] + " ");
		}
		// System.out.println("\n--------");
		// 結果出力
		System.out.println(right[1]);
		for(int i = 1; i < N - 1; i++) {
			System.out.println(Math.max(left[i - 1], right[i + 1]));
		}
		System.out.println(left[N - 2]);
	}
}	 import java.util.Scanner; Scanner java.util public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] A = new int[N];
		int[] left = new int[N];
		int[] right = new int[N];
		for(int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
		}
		sc.close();
		// System.out.println("--------");
		// 左からのMAXを保持
		left[0] = A[0];
		// System.out.print(left[0] + " ");
		for(int i = 1; i < N; i++) {
			left[i] = Math.max(left[i - 1], A[i]);
			// System.out.print(left[i] + " ");
		}
		// System.out.println("");
		// 右からのMAXを保持
		right[N - 1] = A[N - 1];
		// System.out.print(right[N - 1] + " ");
		for(int i = N - 2; i >= 0; i--) {
			right[i] = Math.max(right[i + 1], A[i]);
			// System.out.print(right[i] + " ");
		}
		// System.out.println("\n--------");
		// 結果出力
		System.out.println(right[1]);
		for(int i = 1; i < N - 1; i++) {
			System.out.println(Math.max(left[i - 1], right[i + 1]));
		}
		System.out.println(left[N - 2]);
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] A = new int[N];
		int[] left = new int[N];
		int[] right = new int[N];
		for(int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
		}
		sc.close();
		// System.out.println("--------");
		// 左からのMAXを保持
		left[0] = A[0];
		// System.out.print(left[0] + " ");
		for(int i = 1; i < N; i++) {
			left[i] = Math.max(left[i - 1], A[i]);
			// System.out.print(left[i] + " ");
		}
		// System.out.println("");
		// 右からのMAXを保持
		right[N - 1] = A[N - 1];
		// System.out.print(right[N - 1] + " ");
		for(int i = N - 2; i >= 0; i--) {
			right[i] = Math.max(right[i + 1], A[i]);
			// System.out.print(right[i] + " ");
		}
		// System.out.println("\n--------");
		// 結果出力
		System.out.println(right[1]);
		for(int i = 1; i < N - 1; i++) {
			System.out.println(Math.max(left[i - 1], right[i + 1]));
		}
		System.out.println(left[N - 2]);
	} main {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] A = new int[N];
		int[] left = new int[N];
		int[] right = new int[N];
		for(int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
		}
		sc.close();
		// System.out.println("--------");
		// 左からのMAXを保持
		left[0] = A[0];
		// System.out.print(left[0] + " ");
		for(int i = 1; i < N; i++) {
			left[i] = Math.max(left[i - 1], A[i]);
			// System.out.print(left[i] + " ");
		}
		// System.out.println("");
		// 右からのMAXを保持
		right[N - 1] = A[N - 1];
		// System.out.print(right[N - 1] + " ");
		for(int i = N - 2; i >= 0; i--) {
			right[i] = Math.max(right[i + 1], A[i]);
			// System.out.print(right[i] + " ");
		}
		// System.out.println("\n--------");
		// 結果出力
		System.out.println(right[1]);
		for(int i = 1; i < N - 1; i++) {
			System.out.println(Math.max(left[i - 1], right[i + 1]));
		}
		System.out.println(left[N - 2]);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int[] A = new int[N]; A new int[N] N int[] left = new int[N]; left new int[N] N int[] right = new int[N]; right new int[N] N for(int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			A[i] = sc.nextInt();
		} {
			A[i] = sc.nextInt();
		} A[i] = sc.nextInt() A[i] A i sc.nextInt() sc.nextInt sc sc.close() sc.close sc left[0] = A[0] left[0] left 0 A[0] A 0 for(int i = 1; i < N; i++) {
			left[i] = Math.max(left[i - 1], A[i]);
			// System.out.print(left[i] + " ");
		} int i = 1; int i = 1; i 1 i < N i N i++ i++ i {
			left[i] = Math.max(left[i - 1], A[i]);
			// System.out.print(left[i] + " ");
		} {
			left[i] = Math.max(left[i - 1], A[i]);
			// System.out.print(left[i] + " ");
		} left[i] = Math.max(left[i - 1], A[i]) left[i] left i Math.max(left[i - 1], A[i]) Math.max Math left[i - 1] left i - 1 i 1 A[i] A i right[N - 1] = A[N - 1] right[N - 1] right N - 1 N 1 A[N - 1] A N - 1 N 1 for(int i = N - 2; i >= 0; i--) {
			right[i] = Math.max(right[i + 1], A[i]);
			// System.out.print(right[i] + " ");
		} int i = N - 2; int i = N - 2; i N - 2 N 2 i >= 0 i 0 i-- i-- i {
			right[i] = Math.max(right[i + 1], A[i]);
			// System.out.print(right[i] + " ");
		} {
			right[i] = Math.max(right[i + 1], A[i]);
			// System.out.print(right[i] + " ");
		} right[i] = Math.max(right[i + 1], A[i]) right[i] right i Math.max(right[i + 1], A[i]) Math.max Math right[i + 1] right i + 1 i 1 A[i] A i System.out.println(right[1]) System.out.println System.out System System.out right[1] right 1 for(int i = 1; i < N - 1; i++) {
			System.out.println(Math.max(left[i - 1], right[i + 1]));
		} int i = 1; int i = 1; i 1 i < N - 1 i N - 1 N 1 i++ i++ i {
			System.out.println(Math.max(left[i - 1], right[i + 1]));
		} {
			System.out.println(Math.max(left[i - 1], right[i + 1]));
		} System.out.println(Math.max(left[i - 1], right[i + 1])) System.out.println System.out System System.out Math.max(left[i - 1], right[i + 1]) Math.max Math left[i - 1] left i - 1 i 1 right[i + 1] right i + 1 i 1 System.out.println(left[N - 2]) System.out.println System.out System System.out left[N - 2] left N - 2 N 2 String[] args args public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] A = new int[N];
		int[] left = new int[N];
		int[] right = new int[N];
		for(int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
		}
		sc.close();
		// System.out.println("--------");
		// 左からのMAXを保持
		left[0] = A[0];
		// System.out.print(left[0] + " ");
		for(int i = 1; i < N; i++) {
			left[i] = Math.max(left[i - 1], A[i]);
			// System.out.print(left[i] + " ");
		}
		// System.out.println("");
		// 右からのMAXを保持
		right[N - 1] = A[N - 1];
		// System.out.print(right[N - 1] + " ");
		for(int i = N - 2; i >= 0; i--) {
			right[i] = Math.max(right[i + 1], A[i]);
			// System.out.print(right[i] + " ");
		}
		// System.out.println("\n--------");
		// 結果出力
		System.out.println(right[1]);
		for(int i = 1; i < N - 1; i++) {
			System.out.println(Math.max(left[i - 1], right[i + 1]));
		}
		System.out.println(left[N - 2]);
	}
} public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] A = new int[N];
		int[] left = new int[N];
		int[] right = new int[N];
		for(int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
		}
		sc.close();
		// System.out.println("--------");
		// 左からのMAXを保持
		left[0] = A[0];
		// System.out.print(left[0] + " ");
		for(int i = 1; i < N; i++) {
			left[i] = Math.max(left[i - 1], A[i]);
			// System.out.print(left[i] + " ");
		}
		// System.out.println("");
		// 右からのMAXを保持
		right[N - 1] = A[N - 1];
		// System.out.print(right[N - 1] + " ");
		for(int i = N - 2; i >= 0; i--) {
			right[i] = Math.max(right[i + 1], A[i]);
			// System.out.print(right[i] + " ");
		}
		// System.out.println("\n--------");
		// 結果出力
		System.out.println(right[1]);
		for(int i = 1; i < N - 1; i++) {
			System.out.println(Math.max(left[i - 1], right[i + 1]));
		}
		System.out.println(left[N - 2]);
	}
} Main
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] A = new int[N];
		int[] left = new int[N];
		int[] right = new int[N];
		for(int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
		}
		sc.close();
		// System.out.println("--------");
		// 左からのMAXを保持
		left[0] = A[0];
		// System.out.print(left[0] + " ");
		for(int i = 1; i < N; i++) {
			left[i] = Math.max(left[i - 1], A[i]);
			// System.out.print(left[i] + " ");
		}
		// System.out.println("");
		// 右からのMAXを保持
		right[N - 1] = A[N - 1];
		// System.out.print(right[N - 1] + " ");
		for(int i = N - 2; i >= 0; i--) {
			right[i] = Math.max(right[i + 1], A[i]);
			// System.out.print(right[i] + " ");
		}
		// System.out.println("\n--------");
		// 結果出力
		System.out.println(right[1]);
		for(int i = 1; i < N - 1; i++) {
			System.out.println(Math.max(left[i - 1], right[i + 1]));
		}
		System.out.println(left[N - 2]);
	}
}	
