Given **n **non-negative integers **x1, x2, ..., xn**, where each represents a point at coordinate **(i, xi)**. **n **vertical lines are drawn such that the two endpoints of line **i** is at **(i, xi)** and **(i, 0)**. Write a program to find two lines, which together with the x-axis forms a container, such that the container contains the most water.

**Problem Note: **You may not slant the container and **n **is at least 2.

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (section between hrozontal line) the container can contain is 49.

**Example:**

```
Input: X[] = [1,8,6,2,5,4,8,3,7]
Output: 49
```