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