A10274 | Fence Divercity

Long ago, Vasily built a good fence at his country house. Vasily calls a fence good, if it is a series of $n$ consecutively fastened vertical boards of centimeter width, the height of each in centimeters is a positive integer. The house owner remembers that the height of the $i$ -th board to the left is $h_{i}$ .

Today Vasily decided to change the design of the fence he had built, by cutting his top connected part so that the fence remained good. The cut part should consist of only the upper parts of the boards, while the adjacent parts must be interconnected (share a non-zero length before cutting out of the fence).

You, as Vasily's curious neighbor, will count the number of possible ways to cut exactly one part as is described above. Two ways to cut a part are called distinct, if for the remaining fences there is such $i$ , that the height of the $i$ -th boards vary.

As Vasily's fence can be very high and long, get the remainder after dividing the required number of ways by $1000000007$ $(10^{9}+7)$ .

The first line contains integer $n$ ( $1<=n<=1000000$ ) — the number of boards in Vasily's fence.

The second line contains $n$ space-separated numbers $h_{1},h_{2},...,h_{n}$ ( $1<=h_{i}<=10^{9}$ ), where $h_{i}$ equals the height of the $i$ -th board to the left.

Print the remainder after dividing $r$ by $1000000007$ , where $r$ is the number of ways to cut exactly one connected part so that the part consisted of the upper parts of the boards and the remaining fence was good.