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 C (Clang 3.8.0) (judge verdict: Time Limit Exceeded)

//ABC135C
#include <stdio.h>
#include <string.h>
#include <math.h>
int main(){
	int n;
	scanf("%d",&n);
	int a[n];
	int i, j, k, l, m;
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	int max;
	for(j=0;j<n;j++){
		max = a[0];
		if(j==0){
			max = a[1];
			for(k=2;k<n;k++){
				if(max<a[k]){
					max = a[k];
				}else{
					max = max;
				}
			}
			printf("%d\n",max);
		}else{
			for(l=0;l<j;l++){
				if(max<a[l]){
					max = a[l];
					}else{
						max = max;
					}
			}
			for(m=j+1;m<n;m++){
				if(max<a[m]){
					max = a[m];
				}else{
					max = max;
				}
			}
		printf("%d\n",max);
		}
	}
	return 0;
}