using System;

/*

​

Problem: Climb Stairs in 1 or 2 steps

Solution 1: Use Fibanacci Series with DP (Dictionary to optimise lookup)

​

*/

public class Program

{

    public static void Main()

    {

        int[][] matrix = new int[][] { new int[]{ 1,  5,  9}, new int[]{ 10, 11, 13}, new int[]{12, 13, 15} };

        Console.WriteLine(matrix.GetLength(0));

        Console.WriteLine(matrix[0].Length);

        Console.WriteLine(ClimbStairs(7));

    }

    static int ClimbStairs(int n) {

        int a = 1, b = 1;

        while (n-- > 0)

            a = (b += a) - a;

        return a;

    }

}