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: Time Limit Exceeded)

import java.io.*;
import java.util.*;
import java.util.Arrays;
import java.util.List;
public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int N = scan.nextInt();
        int[] A = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = scan.nextInt();
        }
        String[] s = new String[N];
        for (int i = 0; i < N; i++) {
            s[i] = String.valueOf(A[i]);
        }
        List<String> slist = new ArrayList<String>(Arrays.asList(s));
        for (int j = 0; j < N; j++) {
            slist.remove(s[j]);
          	String[] snew = (String[])slist.toArray(new String[slist.size()]);
            int[] A1 = new int[N - 1];
            for (int k = 0; k < N - 1; k++) {
                A1[k] = Integer.valueOf(snew[k]);
            }
          	slist.add(s[j]);
            int[] max = new int[N];
            for (int k = 0; k < N-1; k++) {
                if (max[j] < A1[k]) {
                    max[j] = A1[k];
                }
            }
            System.out.println(max[j]);
        }

        scan.close();
    }
}