class Solution(object):

     def climbStairs(self, n):

         if n<0:

             return 0

         if n<2:

             return 1

         first,second = 1,1

         for v in range(2,n+1):

             res = first+second

             first,second = second,res
         return res