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::{self, BufRead, Write, BufWriter};

fn read<R: BufRead, T: std::str::FromStr>(input: &mut R) -> T {
    let mut s = String::new();
    input.read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn main() {
    let mut a = vec![];
    {
        let input = io::stdin();
        let mut input = input.lock();
        let n = read::<_, usize>(&mut input);
        for _ in 0..n {
            let ai = read::<_, usize>(&mut input);
            a.push(ai);
        }    
    }

    let mut sorted = a.clone();
    sorted.sort_by(|x, y| y.cmp(x));

    let stdout = io::stdout();
    let mut buf = BufWriter::new(stdout.lock());

    for ai in a.into_iter() {
        let res = if ai == sorted[0] {
            sorted[1]
        } else {
            sorted[0]
        };
        writeln!(buf, "{}", res).unwrap();
    }
}