Climbing Stairs

You are given a staircase with n steps. You can climb the staircase by taking either 1 step or 2 steps at a time. The task is to determine the number of distinct ways to reach the top of the staircase.

The recurrence relation for this problem is given by:

$$F(n) = F(n-1) + F(n-2)$$

with the base cases:

$$F(0)=F(1)=1$$

Solve the problem by reading an integer from standard input and outputting the result to standard output.

inputFormat

The input consists of a single integer n (0 ≤ n ≤ 10^5), which represents the number of steps in the staircase.

Input is provided via standard input (stdin).

outputFormat

Output a single integer denoting the number of distinct ways to climb the staircase. The result should be printed to standard output (stdout).

## sample

0

1