CF407B 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

The first line contains integer $ n $ ( $ 1

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 $ $ (10^{9}+7) $ .