You are given an integer array h of length n. There are n vertical lines drawn such that the two endpoints of the i-th line are (i,0) and (i,h[i]).
Find two lines that together with the x-axis form a container, such that the container contains the most water.
The first line contains the size n (n≤105) of array h. Second line contains n positive integers — the elements of array h, that are no more than 109.
Print the maximum amount of water a container can store.