Problem Statement

One day, Snuke was given a permutation of length $N$, $a_1, a_2, ..., a_N$, from his friend.

Find the following:

Constraints

• $1 ≦ N ≦ 200,000$
• $(a_1, a_2, ..., a_N)$ is a permutation of $(1, 2, ..., N)$.

Input

The input is given from Standard Input in the following format:

N
a_1 a_2 ... a_N

Output

Print the answer.

Note that the answer may not fit into a 32-bit integer.