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>
#include <stdlib.h>
#include <string.h>

#define getchar_unlocked getchar
char input[3000000];
char *p = input;
int ri() {
	int r=0, s=0;
	for(;;){if(*p=='-'){s=1;break;}if(*p<='9'&&*p>='0'){r=*p-'0';break;}p++;}p++;
	for(;;){if(*p<'0'||*p>'9')break;r=r*10+*p-'0';p++;}
	if(s)r=-r;
	return r;
}
char buf[3000000];
char *ptr = buf;
void wi(int n) {
	static char tmp[12];
	char *cur = tmp + 11;
	if (n) {
		while (n) {
			*--cur = n % 10 + '0';
			n /= 10;
		}
	} else *--cur = '0';
	while (*cur) *ptr++ = *cur++;
	*ptr++ = ' ';
}

int main() {
	fread(input, 1, 3000000, stdin);
	int n = ri();
	int a[n];
	for (int i = 0; i < n; i++) a[i] = ri();
	int max = 0, x = 0;
	for (int i = 0; i < n; i++) if (max < a[i]) max = a[i], x = 1; else if (max == a[i]) x++;
	int max2 = 0;
	for (int i = 0; i < n; i++) if (a[i] != max && max2 < a[i]) max2 = a[i];
	for (int i = 0; i < n; i++) {
		if (x == 1 && a[i] == max) wi(max2);
		else wi(max);
	}
	fwrite(buf, 1, ptr - buf, stdout);
	return 0;
}