No tag edit access

E. Trains and Statistic

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputVasya commutes by train every day. There are *n* train stations in the city, and at the *i*-th station it's possible to buy only tickets to stations from *i* + 1 to *a*_{i} inclusive. No tickets are sold at the last station.

Let ρ_{i, j} be the minimum number of tickets one needs to buy in order to get from stations *i* to station *j*. As Vasya is fond of different useless statistic he asks you to compute the sum of all values ρ_{i, j} among all pairs 1 ≤ *i* < *j* ≤ *n*.

Input

The first line of the input contains a single integer *n* (2 ≤ *n* ≤ 100 000) — the number of stations.

The second line contains *n* - 1 integer *a*_{i} (*i* + 1 ≤ *a*_{i} ≤ *n*), the *i*-th of them means that at the *i*-th station one may buy tickets to each station from *i* + 1 to *a*_{i} inclusive.

Output

Print the sum of ρ_{i, j} among all pairs of 1 ≤ *i* < *j* ≤ *n*.

Examples

Input

4

4 4 4

Output

6

Input

5

2 3 5 5

Output

17

Note

In the first sample it's possible to get from any station to any other (with greater index) using only one ticket. The total number of pairs is 6, so the answer is also 6.

Consider the second sample:

- ρ
_{1, 2}= 1 - ρ
_{1, 3}= 2 - ρ
_{1, 4}= 3 - ρ
_{1, 5}= 3 - ρ
_{2, 3}= 1 - ρ
_{2, 4}= 2 - ρ
_{2, 5}= 2 - ρ
_{3, 4}= 1 - ρ
_{3, 5}= 1 - ρ
_{4, 5}= 1

Thus the answer equals 1 + 2 + 3 + 3 + 1 + 2 + 2 + 1 + 1 + 1 = 17.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/18/2020 10:27:33 (e1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|