B"One day, little Vasya found himself in a maze consisting of (n xe2 x80 x89+ xe2 x80 x891) rooms, numbered from 1 to (n xe2 x80 x89+ xe2 x80 x891). Initially, Vasya is at the first room and to get out of the maze, he needs to get to the (n xe2 x80 x89+ xe2 x80 x891)-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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n), someone can use the first portal to move from it to room number (i xe2 x80 x89+ xe2 x80 x891), also someone can use the second portal to move from it to room number pi, where 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89pi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i. In order not to get lost, Vasya decided to act as follows. Help Vasya determine the number of times he needs to use portals to get to room (n xe2 x80 x89+ xe2 x80 x891) in the end. The first line contains integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89103) -- the number of rooms. The second line contains n integers pi (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89pi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i). Each pi denotes the number of the room, that someone can reach, if he will use the second portal in the i-th room. 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 xe2 x80 x89+ xe2 x80 x897)."...