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 Rust (1.15.1) (judge verdict: Accepted)

use std::io::{stdin, BufRead};

fn main() {
    let stdin = stdin();
    let cin = stdin.lock();
    let mut lines = cin.lines();
    let n = {
        let line = lines.next().unwrap().unwrap();
        line.parse::<usize>().unwrap()
    };
    let mut aa = Vec::with_capacity(n);
    for _ in 0..n {
        aa.push({
          let line = lines.next().unwrap().unwrap();
            line.parse::<i32>().unwrap()
        });
    }
    let mut bb = aa.clone();
    bb.sort();
    let b0 = bb.pop().unwrap();
    let b1 = bb.pop().unwrap();
    for a in aa {
        if a < b0 {
            println!("{}", b0);
        } else {
            println!("{}", b1);
        }
    }
}