Finally, Pied Piper has launched its beta version. Raviga Capital Management's lead partner Laurie Bream is throwing a grand party on Pied Piper's success. But in reality, the Pied Piper Team is worried about degrading numbers of daily Pied Piper users. They know that Laurie will stop funding Pied Piper. So they asked Monica for help. Monica says that some of the guests coming to party can be potential investors. Since Richard and Team have bad communication skills, they asked Monica and Jared to talk with potential investors and get their contacts. Monica and Jared have decided to handle guests in the following manner: Any one of Jared or Monica may start handling guests. Once Monica starts handling guests, she must have to handle each alternate guest. Suppose the first guest handled by Monica is G_m. Then Monica will handle every alternate guest

G_m+2, G_m+4, G_m+6...

She can handle other guests she wants to. There is no such compulsion for Jared. He will handle the remaining guests.

Erlich gives you the task to determine the number of ways in which N guests can be handled module 10⁹ + 7.

Constraints:

As the answer can be large print it modulo 1000000007.
1 ≤ N ≤ 10^9

Input:
A single line containing N

Output:
A single line containing the number of ways in which N guests can be handled

Sample for understanding:
Input:
2
Output:
4
Explaination:
Here, the possible ways are
MJ, JM, JJ, MM
Hence output is 4