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;
use std::io::prelude::*;

fn main() {
    let mut s = String::new();
    let _ = io::stdin().read_to_string(&mut s).unwrap();
    let v: Vec<i32> = s.split('\n')
                       .filter(|x| !x.is_empty())
                       .map(|x| x.parse::<i32>().unwrap())
                       .collect();

    let mut v2 = v[1..].to_vec();
    v2.sort();

    let vec_size = v2.len() - 1;
    let first_max = v2[vec_size];
    let second_max = v2[vec_size - 1];

    if first_max == second_max {
        for _ in 0..(vec_size + 1) {
            println!("{}", first_max);
        }
    } else {
        for i in &v[1..] {
            if i == &first_max {
                println!("{}", second_max);
            }else {
                println!("{}", first_max);
            }
        }
    }
}