Killjee and steps
Problem
Killjee is trying to climb a ladder, in a single step killjee can climb any number of ladders. Now, killjee wonders in how many different ways killjee can climb the whole ladder and reach the top.
INPUT
Only line of input contains a single integer , denoting number of ladders to climb.
OUTPUT
Print the answer % 10^9+7
CONSTRAINTS
.
Time Limit: 1
Memory Limit: 256
Source Limit:
Explanation
Two ways to climb are:
1->3
1->2->3
