Climbing Stairs (Distinct Step Combinations)

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 <= n <= 45` ### Input Format A single integer `n`. ### Output Format Print the integer number of distinct ways to reach the top.