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 (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
void quicksort(int a[], int left, int right){
    int p;
	int L = left, R = right;
	int temp;
	p = a[(left + right) / 2];

	while (1){
		while (a[L] < p) L++; while (a[R] > p)
			R--;
		
		if (L >= R)
			break;

		temp = a[R];
		a[R] = a[L];
		a[L] = temp;

		L++;
		R--;
	}
	if (left < L - 1) quicksort(a, left, L - 1);
    if (right > R + 1)quicksort(a, R + 1, right); 
	
}
int main(){
    int a, b, c, n, i;
    c = 0;
    a = 0;
    int A[200001];
    int B[200001];
    scanf("%d", &n);
    for(i = 0; i < n; i++){
        scanf("%d", &A[i]);
        B[i] = A[i];
    }
    quicksort(A, 0 , n-1);
    for(i = 0; i< n; i++){
        if(B[i] != A[n-1]){
            B[i] = A[n-1];
        }else if(B[i] == A[n-1] && A[n-1] == A[n-2]){
            B[i] = A[n-1];
        }else{
            B[i] = A[n-2];
        }
    }
    for(i = 0 ; i < n; i++){
        printf("%d\n", B[i]);
    }    
    return 0;
}