For this Question: Sara is trying to open a lock for that she needs a passcode. Sara knows that the passcode contains N digits in it and the digits at even indices(0- indexing) are even and the digits at odd indices are {2, 3, 5, 7}.
Now Sara wants to know how many different passcodes are possible so that she can open her lock.The input contains a single integer N.

Constraints:-
1 <= N <= 10^15Print the number of possible passcodes.

Note:-
Since the answer can be quite large so print your ans modulo 10^9+7.Sample Input:-
1

Sample Output:-
5

Explanation:-
Possible answer:- 0,2,4,6,8

Sample Input:-
4

Sample Output:-
400, I have written this Solution Code: import java.io.*;
import java.util.*;
import java.math.*;



class Main {
    public static void main (String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();
        BigInteger five = new BigInteger("5");
        BigInteger four = new BigInteger("4");
        BigInteger m = new BigInteger("1000000007");
        long fourPower = n/2;
        long fivePow = n - fourPower;
        BigInteger res = five.modPow(BigInteger.valueOf(fivePow),m);
        BigInteger res2 = four.modPow(BigInteger.valueOf(fourPower),m);
        long ans = (res.longValue()* res2.longValue())%mod;
        System.out.print(ans);
    }
    static long mod = 1000000007;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?