# Week 2 - Climbing Stair
# Description
You are climbing a staircase. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? (จะมีกี่วิธีที่แตกต่างกันในการขึ้นบันได) Note: Given n will be a positive integer.
# Specification
| Input | Output |
|---|---|
| (Positive Integer) Numbers of Staircase | Distinct ways to climb the staircase. |
# Sample Input / Output
| Input | Output |
|---|---|
| 1 | 1 |
| 2 | 2 |
| 3 | 3 |
| 4 | 5 |
| 5 | 8 |