# You are climbing a stair case. 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.
#
# Example 1:
#
# Input: 2
# Output:  2
# Explanation:  There are two ways to climb to the top.
# 1. 1 step + 1 step
# 2. 2 steps
#
# Example 2:
#
# Input: 3
# Output:  3
# Explanation:  There are three ways to climb to the top.
# 1. 1 step + 1 step + 1 step
# 2. 1 step + 2 steps
# 3. 2 steps + 1 step


class Solution(object):
    def 
(self, n):
        """
        :type n: int
        :rtype: int
        """
        table = [1, 2]
        i = 2
        while i < n:
            table.append(table[i-1] + table[i-2])
            i += 1
        return table[n-1]

# Note:
# Generate two trees one with 1 step and other with 2 step and add both

climbStairs