Climbing Stairs
You climb a staircase of steps, taking 1 or 2 steps at a time. In how many distinct ways can you reach the top? Print the answer modulo .
Input
A single integer .
Output
The number of ways modulo 1000000007.
Constraints
Sample 1
Input
2
Output
2
Sample 2
Input
3
Output
3