Problem - Climbing Stairs

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?

For $n = 3$: you can go 1+1+1, 1+2, or 2+1. That is 3 ways. This problem connects counting to recursion.