Problem Description

You are at step 0 and want to reach step n. Each move you can go +1 or +2. Output number of ways modulo 1000000007.

Input Format

One integer n.

Output Format

One integer ways.

Sample Test Case

Input:
5
Output:
8

Constraints

0

Solutions (0)

No solutions submitted yet. Be the first!

Discussion (0)

No comments yet. Start the discussion!

Prev Next