Competitions

# Техника двух указателей

# Container With Most Water

You are given an integer array **height** of length **n**. There are **n** vertical lines drawn such that the two endpoints of the **i**-th line are (**i**, **0**) and (**i**, `height`

)._{i}

Find two lines that together with the **x**-axis form a container, such that the container contains the most water.

#### Input

The first line contains the size **n** (**n** ≤ `10`

) of array ^{5}**height**. Second line contains **n** positive integers - the elements of array **height**, that are no more than `10`

.^{9}

#### Output

Print the maximum amount of water a container can store.

Input example #1

9 1 8 6 2 5 4 8 3 7

Output example #1

49