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)

fn read_line() -> String {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim_right().to_owned()
}

fn read_stdin() -> String {
    use std::io::Read;
    let mut s = String::new();
    std::io::stdin().read_to_string(&mut s).unwrap();
    s
}

fn main() {
    read_line();
    let mut v: Vec<(u64, usize)> = read_stdin()
        .split_whitespace()
        .map(|x| x.parse().unwrap())
        .enumerate()
        .map(|(i, x)| (x, i))
        .collect();
    v.sort();
    
    let mut out = vec![0; v.len()];
    for (j, &(_, i)) in v.iter().enumerate() {
        let last = v.len() - 1;
        if j == last {
            out[i] = v[last - 1].0;
        } else {
            out[i] = v[last].0;
        }
    }
    
    println!("{}", out.into_iter().map(|x| x.to_string()).collect::<Vec<_>>().join("\n"));
}