562. Cheems' Staircase Challenge
0
Easy
Cheems needs to reach the top of a staircase that has n steps.
He can climb either 1 step or 2 steps at a time.
How many different ways can Cheems climb to the top?
Note: n will always be a positive integer.
He can climb either 1 step or 2 steps at a time.
How many different ways can Cheems climb to the top?
Note: n will always be a positive integer.
Input Format
The first line of input contains an integer n.
Output Format
Print the total number of distinct ways Cheems can climb to the top.
Example
Input
2
Output
2
Constraints
1 <= n <= 45
Loading...
View Submissions
Console