Climbing Stairs

You are standing at the bottom of a staircase with n steps. On each move, you may climb either 1 step or 2 steps. Count how many different move sequences land exactly on the top.

Examples
Input: 2
Output: 2
Hints
Related Problems

Climbing Stairs

You are standing at the bottom of a staircase with `n` steps. On each move, you may climb either 1 step or 2 steps. Count how many different move sequences land exactly on the top.