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 Perl (v5.18.2) (judge verdict: Time Limit Exceeded)

my $max = 0;
my $count = 0;
my $n = 0;
my @A_n = ();

while (<STDIN>) {
    if ($count == 0){ 
        $n = $_;
        $count++;
        next; 
    }

    push(@A_n, $_);
}


for ($i=0; $i<$n; $i++) {
    my $max = 0;
    my $a_i = @A_n[$i];

    for ($j=0; $j<$n; $j++) {
        if ($i == $j) {
            next;
        }

        my $a_j = @A_n[$j];

        if ($a_j > $max) {
            $max = $a_j;
        }
    }

    print "$max";

    if ($i != $n -1 ){
        print "\n";
    }
}