Climbing Stairs

Easy

You are climbing a staircase with n steps. Each time you can climb 1 or 2 steps. In how many distinct ways can you reach the top?

Example 1

Input:  n = 2
Output: 2

Example 2

Input:  n = 3
Output: 3

Constraints

• 1 <= n <= 45