407.B Long Path（递推）

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
2
1 2
Output
4
Input
4
1 1 2 3
Output
20
Input
5
1 1 1 1 1
Output
62

题目大意：有一个迷宫，有n+1个房间，我们一开始在第一个房间。每当到达某一个房间的时候，我们会在该房间上画一个标记。当我们在第i个房间时，且当前房间标记数为奇数时，我们会进入第p[i]个房间，而当前房屋标记为偶数时，我们会进入第i+1个房间，问走到第n+1房间需要多少步。

题目分析：

1. 状态表示：f[i] //表示从起点到达第i个房间需要的步数
2. 状态计算：
   1）要想走到第i个房间，首先要走到第i-1个房间，所以f[i]=f[i-1].
   2）再走一步到达第p[i]个房间，所以再+1
   3）要想从第p[i]个房间走回第i个房间的步数是f[i]-f[p[i]]，所以再+(f[i]-f[p[i]])
   4）走回了第i-1个房间以后，i-1房间的标记就是偶数了(为2)，然后再走一步走 到第i个房间，所以再+1。这样就到达了第i个房间
   综合起来，状态转移方程即为：f[i]=2*f[i-1]-f[p[i]]+2

代码如下：

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <map>
#include <queue>
#include <algorithm>
#include <iomanip>
#define LL long long
using namespace std;
const int N=1e3+5,mod=1e9+7;
LL p[N],f[N];
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	cin>>p[i];
	f[1]=0;    //初始化,走到第1个房间需要的步数为0
	for(int i=2;i<=n+1;i++)   n+1为终点
	{
		f[i]=(f[i-1]*2-f[p[i-1]]+2+mod)%mod;
	}
	cout<<f[n+1]<<endl;
	return 0;
}