Problem:
Score : 300 points

Problem Statement

You are given a sequence of length N: A_1, A_2, ..., A_N.
For each integer i between 1 and N (inclusive), answer the following question:

Find the maximum value among the N-1 elements other than A_i in the sequence.

Constraints

2 \leq N \leq 200000

1 \leq A_i \leq 200000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1
:
A_N

Output

Print N lines. The i-th line (1 \leq i \leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.

Sample Input 1

3
1
4
3

Sample Output 1

4
3
4

The maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.

The maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.

The maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.

Sample Input 2

2
5
5

Sample Output 2

5
5

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.util.Scanner;

class Main{
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[n];
		for(int i=0;i<a.length;i++){
			a[i] = sc.nextInt();
		}
		int tmp[] = new int[n];
		for(int i=0;i<n;i++){
			tmp[i]=a[i];
		}
		for(int j=0;j<a.length-1;j++){
			for(int k=1;k<a.length;k++){
				if(tmp[k-1]<tmp[k])
				{
					int t = tmp[k];
					tmp[k] = tmp[k-1];
					tmp[k-1] = t;
				}
			}
		}
		for(int i=0;i<a.length;i++){
			if(tmp[0]!=a[i]){
				System.out.println(tmp[0]);
			}else{
				System.out.println(tmp[1]);
			}
		}

	}
}