# Container With Most Water

easy

1. You will be given coordinates as an array wherein, x,y is written as i,a[i] 2. So two endpoints of vertical line i is at (i, a[i]) and (i, 0) 3. You need to find two lines, which together along with x-axis forms a container, such that the container contains the most water 4. Input and output is handled for you 5. It is a functional problem ,please do not modify main() NOTE: a) a[i] value need not be distinct b) You can't slant a line

## Constraints

Array size is limited to integral range

## Format

### Input

Input is handled for you.

### Output

Output is handled

## Example

Sample Input

8
2 10 6 5 8 7 1 3

### Sample Output

28