**THE MOST IMPORTANT THING IS CONSTRAINTS WHICH IS N CAN BE 10^15. **You are given a binary string that consists of 3 ones and 2 zeroes. After applying an operation, the string contains 4 ones and 3 zeroes. This operation is applied repeatedly on the string. The information about the newly-generated binary string at any Instant is as follows: 2 . The number of ones in the th string is equal to the number of ones that is available in the (i-1)th string plus thrice the number of zeroes present in the (-2)th string. • The number of zeroes in the th string will be equal to twice the number of zeroes in the (i-1)th string plus twice the number of ones in the (1-2)th string. Your task is to find the number of ones that are available in the a th string, as the strings become quite large in every step. Since the answer can be very large, print the answer modulo 10^9 +7.