Climbing Stairs

Statement

You are climbing a staircase. It takes n steps to reach the top. Each time, you can either climb $1$ or $2$ steps. In how many distinct ways can you climb to the top?

Constraints:

• $1 \leq$ n $\leq 45$

Examples