Climbing Stairs with Huge n

You climb 1 or 2 steps at a time. Print the number of distinct ways to reach step n modulo 1,000,000,007.

1 <= n <= 10^18