You are given an integer array height of length n. There are n vertical lines where 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 that holds the most water. Return the maximum amount of water.

Example 1:

Input: 1 8 6 2 5 4 8 3 7
Output: 49

Example 2:

Input: 1 1
Output: 1

Constraints:

• n == height.length, 2 ≤ n ≤ 10⁵
• 0 ≤ height[i] ≤ 10⁴

Input format: Space-separated heights.

Output format: Maximum water volume.