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 Data.List
import Control.Monad
import Data.Maybe

maxNum :: [Int] -> Int
maxNum = foldr1 (\x acc -> if x > acc then x else acc)

foo :: [Int] -> (Int,Int) -> (Int,Int)
foo [] tup = tup
foo (n:ns) (big,sndBig)
  | n > big = foo ns (n,sndBig)
  | n > sndBig = foo ns (big,n)
  | otherwise = foo ns (big,sndBig)

bar :: [Int] -> Int -> Int -> [Int]
bar ints big sndBig = map (\n -> if n == big then sndBig else big) ints

printList :: [Int] -> IO ()
printList ints = mapM_ putStrLn $ lines $ intercalate "\n" $ map show ints

main = do
  n <- read <$> getLine :: IO Int
  ints <- replicateM n (read <$> getLine) :: IO [Int]
  let (i,j) = foo ints (0,0)
  printList $ bar ints i j