Practice - Climbing Stairs

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

For example, if $n = 3$, there are $3$ ways: $1+1+1$, $1+2$, $2+1$.

Hint: this follows the Fibonacci sequence. If $ways[i]$ is the number of ways to reach step $i$, then $ways[i] = ways[i-1] + ways[i-2]$.