#include <iostream>
#include <set>
#define REP(i, a, n) for(int i = a; i <= n; i++)
using namespace std;
 
 
const int SIZE = 200001;
int N, a[SIZE], pos[SIZE];
long ans;
set<int> s;
 
int main(void) {
  cin >> N;
  REP(i, 1, N) {
    cin >> a[i];
    pos[a[i]] = i;
  }
 
  s.insert(0);
  s.insert(N + 1);
  ans = 0;
 
  REP(i, 1, N) {
    set<int>::iterator itr = s.lower_bound(pos[i]);
    int r = *itr - pos[i];
    int l = pos[i] - *(--itr);
    ans += (long) i * r * l;
    s.insert(pos[i]);
  }
 
  cout << ans << endl;
 
  return 0;
}
### Prompt

Your task is to create a cpp solution to the following problem:

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

Find the following:

<image>

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.

Examples

Input

3
2 1 3


Output

9


Input

4
1 3 2 4


Output

19


Input

8
5 4 8 1 2 6 7 3


Output

85

### Response

```cpp
#include <iostream>
#include <set>
#define REP(i, a, n) for(int i = a; i <= n; i++)
using namespace std;
 
 
const int SIZE = 200001;
int N, a[SIZE], pos[SIZE];
long ans;
set<int> s;
 
int main(void) {
  cin >> N;
  REP(i, 1, N) {
    cin >> a[i];
    pos[a[i]] = i;
  }
 
  s.insert(0);
  s.insert(N + 1);
  ans = 0;
 
  REP(i, 1, N) {
    set<int>::iterator itr = s.lower_bound(pos[i]);
    int r = *itr - pos[i];
    int l = pos[i] - *(--itr);
    ans += (long) i * r * l;
    s.insert(pos[i]);
  }
 
  cout << ans << endl;
 
  return 0;
}
```