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 Haskell (GHC 7.10.3) (judge verdict: Accepted)

import Control.Monad
import Text.Printf
import Data.List

getInts :: IO [Int]
getInts = map read . words <$> getLine

main :: IO()
main = do
  n <- readLn
  as <- replicateM n $ getInts
  let aas = concat as
  printf "%s" $ slv aas

slv ::[Int] -> String
slv [a] = show a
slv (a:as) = slv2 (a:as) max1 max2 []
  where (max1:max2:ret) = reverse $ sort (a:as)

slv2 :: [Int] -> Int -> Int -> [String] -> String
slv2 [] _ _ ret = unlines $ reverse ret
slv2 (a:as) max1 max2 ret | a == max1 = slv2 as max1 max2 ((show max2):ret)
                          | otherwise = slv2 as max1 max2 ((show max1):ret)