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::collections::HashMap;

fn main()  {
    let mut line = String::new();
    io::stdin().read_line(&mut line).ok();
    let N = line.trim().parse::<i64>().unwrap();
    let mut A_hash: HashMap<i64, i64> = HashMap::new();
    for i in 0..N{
        let mut line = String::new();
        io::stdin().read_line(&mut line).ok();
        let a = line.trim().parse::<i64>().ok().unwrap(); 
        A_hash.insert(i, a);
    }

    let mut A_vec: Vec<_> = A_hash.iter().collect();
    A_vec.sort_by(|a, b| b.1.cmp(a.1));

    let max_index = A_vec[0].0;
    let max_num = A_vec[0].1;
    let second_max_num = A_vec[1].1;

    for i in 0..N{
        if i == *max_index{
            println!("{}", second_max_num);
        }
        else{
            println!("{}", max_num);
        }
    }
}