import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = Integer.parseInt(scan.nextLine());
		int A[] = new int[N];
		int max_1 = 0, max_2 = 0;
		int kai;
		
		for(int i = 0; i < N; i++) {
			A[i] = Integer.parseInt(scan.nextLine());
			if (max_1 < A[i] && max_2 < A[i]) {
				max_2 = max_1;
				max_1 = A[i];
				
			} else if (max_2 < A[i]) {
				max_2 = A[i];
			}
		}
		
		for (int i = 0; i < N; i++ ) {
			kai = max_1;
			if (max_1 == A[i]) {
				kai = max_2;
			}
			System.out.println(kai);
		}
				 
		scan.close();
	}

} import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = Integer.parseInt(scan.nextLine());
		int A[] = new int[N];
		int max_1 = 0, max_2 = 0;
		int kai;
		
		for(int i = 0; i < N; i++) {
			A[i] = Integer.parseInt(scan.nextLine());
			if (max_1 < A[i] && max_2 < A[i]) {
				max_2 = max_1;
				max_1 = A[i];
				
			} else if (max_2 < A[i]) {
				max_2 = A[i];
			}
		}
		
		for (int i = 0; i < N; i++ ) {
			kai = max_1;
			if (max_1 == A[i]) {
				kai = max_2;
			}
			System.out.println(kai);
		}
				 
		scan.close();
	}

} Main public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = Integer.parseInt(scan.nextLine());
		int A[] = new int[N];
		int max_1 = 0, max_2 = 0;
		int kai;
		
		for(int i = 0; i < N; i++) {
			A[i] = Integer.parseInt(scan.nextLine());
			if (max_1 < A[i] && max_2 < A[i]) {
				max_2 = max_1;
				max_1 = A[i];
				
			} else if (max_2 < A[i]) {
				max_2 = A[i];
			}
		}
		
		for (int i = 0; i < N; i++ ) {
			kai = max_1;
			if (max_1 == A[i]) {
				kai = max_2;
			}
			System.out.println(kai);
		}
				 
		scan.close();
	} main {
		Scanner scan = new Scanner(System.in);
		int N = Integer.parseInt(scan.nextLine());
		int A[] = new int[N];
		int max_1 = 0, max_2 = 0;
		int kai;
		
		for(int i = 0; i < N; i++) {
			A[i] = Integer.parseInt(scan.nextLine());
			if (max_1 < A[i] && max_2 < A[i]) {
				max_2 = max_1;
				max_1 = A[i];
				
			} else if (max_2 < A[i]) {
				max_2 = A[i];
			}
		}
		
		for (int i = 0; i < N; i++ ) {
			kai = max_1;
			if (max_1 == A[i]) {
				kai = max_2;
			}
			System.out.println(kai);
		}
				 
		scan.close();
	} Scanner scan = new Scanner(System.in); scan new Scanner(System.in) int N = Integer.parseInt(scan.nextLine()); N Integer.parseInt(scan.nextLine()) Integer.parseInt Integer scan.nextLine() scan.nextLine scan int A[] = new int[N]; A new int[N] N int max_1 = 0 max_1 0 max_2 = 0; max_2 0 int kai; kai for(int i = 0; i < N; i++) {
			A[i] = Integer.parseInt(scan.nextLine());
			if (max_1 < A[i] && max_2 < A[i]) {
				max_2 = max_1;
				max_1 = A[i];
				
			} else if (max_2 < A[i]) {
				max_2 = A[i];
			}
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			A[i] = Integer.parseInt(scan.nextLine());
			if (max_1 < A[i] && max_2 < A[i]) {
				max_2 = max_1;
				max_1 = A[i];
				
			} else if (max_2 < A[i]) {
				max_2 = A[i];
			}
		} {
			A[i] = Integer.parseInt(scan.nextLine());
			if (max_1 < A[i] && max_2 < A[i]) {
				max_2 = max_1;
				max_1 = A[i];
				
			} else if (max_2 < A[i]) {
				max_2 = A[i];
			}
		} A[i] = Integer.parseInt(scan.nextLine()) A[i] A i Integer.parseInt(scan.nextLine()) Integer.parseInt Integer scan.nextLine() scan.nextLine scan if (max_1 < A[i] && max_2 < A[i]) {
				max_2 = max_1;
				max_1 = A[i];
				
			} else if (max_2 < A[i]) {
				max_2 = A[i];
			} max_1 < A[i] && max_2 < A[i] max_1 < A[i] max_1 A[i] A i max_2 < A[i] max_2 A[i] A i {
				max_2 = max_1;
				max_1 = A[i];
				
			} max_2 = max_1 max_2 max_1 max_1 = A[i] max_1 A[i] A i if (max_2 < A[i]) {
				max_2 = A[i];
			} max_2 < A[i] max_2 A[i] A i {
				max_2 = A[i];
			} max_2 = A[i] max_2 A[i] A i for (int i = 0; i < N; i++ ) {
			kai = max_1;
			if (max_1 == A[i]) {
				kai = max_2;
			}
			System.out.println(kai);
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			kai = max_1;
			if (max_1 == A[i]) {
				kai = max_2;
			}
			System.out.println(kai);
		} {
			kai = max_1;
			if (max_1 == A[i]) {
				kai = max_2;
			}
			System.out.println(kai);
		} kai = max_1 kai max_1 if (max_1 == A[i]) {
				kai = max_2;
			} max_1 == A[i] max_1 A[i] A i {
				kai = max_2;
			} kai = max_2 kai max_2 System.out.println(kai) System.out.println System.out System System.out kai scan.close() scan.close scan String[] args args public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = Integer.parseInt(scan.nextLine());
		int A[] = new int[N];
		int max_1 = 0, max_2 = 0;
		int kai;
		
		for(int i = 0; i < N; i++) {
			A[i] = Integer.parseInt(scan.nextLine());
			if (max_1 < A[i] && max_2 < A[i]) {
				max_2 = max_1;
				max_1 = A[i];
				
			} else if (max_2 < A[i]) {
				max_2 = A[i];
			}
		}
		
		for (int i = 0; i < N; i++ ) {
			kai = max_1;
			if (max_1 == A[i]) {
				kai = max_2;
			}
			System.out.println(kai);
		}
				 
		scan.close();
	}

} public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = Integer.parseInt(scan.nextLine());
		int A[] = new int[N];
		int max_1 = 0, max_2 = 0;
		int kai;
		
		for(int i = 0; i < N; i++) {
			A[i] = Integer.parseInt(scan.nextLine());
			if (max_1 < A[i] && max_2 < A[i]) {
				max_2 = max_1;
				max_1 = A[i];
				
			} else if (max_2 < A[i]) {
				max_2 = A[i];
			}
		}
		
		for (int i = 0; i < N; i++ ) {
			kai = max_1;
			if (max_1 == A[i]) {
				kai = max_2;
			}
			System.out.println(kai);
		}
				 
		scan.close();
	}

} Main
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = Integer.parseInt(scan.nextLine());
		int A[] = new int[N];
		int max_1 = 0, max_2 = 0;
		int kai;
		
		for(int i = 0; i < N; i++) {
			A[i] = Integer.parseInt(scan.nextLine());
			if (max_1 < A[i] && max_2 < A[i]) {
				max_2 = max_1;
				max_1 = A[i];
				
			} else if (max_2 < A[i]) {
				max_2 = A[i];
			}
		}
		
		for (int i = 0; i < N; i++ ) {
			kai = max_1;
			if (max_1 == A[i]) {
				kai = max_2;
			}
			System.out.println(kai);
		}
				 
		scan.close();
	}

}
