Given an integer n, you are asked to calculate the number of different bit-strings of length n. As the resulting number might be too big, the output should contain the number of bit-strings modulo (1000000007).
Input
The input contains a single integer n (1 ≤ n ≤ ).
Output
The program should print the number of bit-strings of length n modulo .