Climbing Stairs

Source of the problem: LeetCode

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Input

Each test case contains only one line, with only one positive integer n (n ≤ 100), which indicates the number of steps to reach to the top.

Output

For each test case, print the number of distinct ways you can climb to the top.

4

5