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>

int compare_long(const void *a, const void *b) {
	long *x = (long *)a;
	long *y = (long *)b;

	if(*x > *y) {
		return -1;
	} else if(*x < *y) {
		return 1;
	} else {
		return 0;
	}
}

int main() {
	long N;
	long *A, *cpy_A;
	long i;

	scanf("%ld", &N);

	A = (long *)malloc(sizeof(long) * N);
	cpy_A = (long *)malloc(sizeof(long) * N);

	for(i = 0; i < N; i++) {
		scanf("%ld", &A[i]);
	}

	memcpy(cpy_A, A, sizeof(long) * N);

	qsort(A, N, sizeof(A[0]), compare_long);
	
	for(i = 0; i < N; i++) {
		if(A[0] == cpy_A[i]) {
			printf("%ld\n", A[1]);
		} else {
			printf("%ld\n", A[0]);
		}
	}

	return 0;
}