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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;

public class Main{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0; i < n; i++)
            a[i] = sc.nextInt();
        
        int max1 = max(a);
        int max2 = sec_max(a);
        for(int i = 0; i < n; i++){
            if(max1 == i)
                System.out.println(a[max2]);
            else
                System.out.println(a[i]);
        }
        sc.close();  
    }

    static int max(int[] a){
        int max = a[0];
        int index = 0;
        for(int i = 1; i < a.length; i++){
            if(a[i] > max) {
                max = a[i];
                index = i;
            }
        }
        return index;
    }

    static int sec_max(int[] a){
        int max1 = a[0];
        int max2 = a[0];
        int index1 = 0;
        int index2 = 0;
        for(int i = 1; i < a.length; i++){
            if(a[i] > max1) {
                max2 = max1;
                index2 = index1;
                max1 = a[i];
                index1 = i;
            } else if(a[i] > max2){
                max2 = a[i];
                index2 = i;
            }
        }
        return index2;
    }
}