B. Bear and Blocks

One day, little Vasya found himself in a maze consisting of (n + 1) rooms, numbered from 1 to (n + 1). Initially, Vasya is at the first room and to get out of the maze, he needs to get to the (n + 1)-th one.

The maze is organized as follows. Each room of the maze has two one-way portals. Let's consider room number i (1 ≤ i ≤ n), someone can use the first portal to move from it to room number (i + 1), also someone can use the second portal to move from it to room number pi, where 1 ≤ pi ≤ i.

In order not to get lost, Vasya decided to act as follows.

• Each time Vasya enters some room, he paints a cross on its ceiling. Initially, Vasya paints a cross at the ceiling of room 1.
• Let's assume that Vasya is in room i and has already painted a cross on its ceiling. Then, if the ceiling now contains an odd number of crosses, Vasya uses the second portal (it leads to room pi), otherwise Vasya uses the first portal.

Help Vasya determine the number of times he needs to use portals to get to room (n + 1) in the end.

Input

The first line contains integer n (1 ≤ n ≤ 103) — the number of rooms. The second line contains n integers pi (1 ≤ pi ≤ i). Each pi denotes the number of the room, that someone can reach, if he will use the second portal in the i-th room.

Output

Print a single number — the number of portal moves the boy needs to go out of the maze. As the number can be rather large, print it modulo 1000000007 (109 + 7).

Examples

input

Copy

2
1 2

output

Copy

4

input

Copy

4
1 1 2 3

output

Copy

20

input

Copy

5
1 1 1 1 1

output

Copy

62

题意:

有n+1个房间，走到一个房间就要标记一次，偶数就跳到pi的房间，pi<=i;

奇数就直接到i+1的房间。

思路：

这道题开始想模拟，但发现不行，还有没注意pi<=i;

我们可以设计dp(i)为1到i的步数，如果我们现在在i房间，那么前面的房间标记的次数是偶数等价于0，那么此时的i是偶数次要先回到pi再由pi回到i（dp[i]-dp[pi]步）在从i到i+1（1步）；

所以可得状态方程 dp[i+1]=dp[i]+dp[i]-dp[p[i]]+2;

2时i到p[i]要一步，到i+1要一步。

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define LL long long

using namespace  std;
const int  maxn=1e5+10;
const int  mod=1000000007;
LL dp[maxn];
int a[maxn];

int main()
{
    int n;
    cin>>n;

    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    dp[1]=0;
    for(int i=1;i<=n;i++)
    {
        dp[i+1]=(2*dp[i]%mod-dp[a[i]]%mod+2+mod)%mod;
    }
    cout<<dp[n+1]<<endl;
    return 0;
}