people are waiting in line to enter a concert. People get bored waiting so they turn and look for someone familiar in the line.

Two persons and standing in line can see each other if they're standing right next to each other or if **no person between them is strictly taller** than person or person .

Write a program that determines the number of pairs of people that can see each other.

#### Input Specification

The first line of input contains an integer , the number of people standing in line.

Each of the following lines contains a single integer, the height of one person in nanometres.

Everyone will be shorter than nanometres.

The heights are given in the order in which people are standing in line.

#### Output Specification

Output the number of pairs of people that can see each other on a single line.

#### Sample Input

```
7
2
4
1
2
2
5
1
```

#### Sample Output

`10`

## Comments

nvm

The problem is from the Croatian Olympiad in Informatics (COI), not the Croatian Open Competition in Informatics (COCI).

Is there a point inconsistency with https://dmoj.ca/problem/vmss7wc15c2p3? My solution AC's the latter but TLE's this one.

Java stack is too slow for this problem. Change your stack into an array which will resolve the TLE.