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: Accepted)

#include <stdio.h>


int main()
{
	int N;
	scanf("%d", &N);
	int a[N+1];
	int i = 0;
	while (i < N)
		scanf("%d", &a[i++]);
	i = 0;
	int max = 0;
	int max_index;
	while (i < N)
	{
		if (a[i] > max)
		{
			max = a[i];
			max_index = i;
		}
		i++;
	}
	i = 0;
	int second = 0;
	int sec_index;
	while (i < N)
	{
		if (i != max_index && a[i] > second)
		{
			second = a[i];
			sec_index = i;
		}
		i++;
	}
	i = 0;
	while (i < N)
	{
		// printf("%d ", a[i]);
		if (i != max_index)
			printf("%d\n", a[max_index]);
		else if (i == max_index)
			printf("%d\n", a[sec_index]);
		i++;
	}
	return (0);
}