For this Question: Find the number of strings of length N, such that the character 'a' occurs at least once in the string and the string consists of lowercase letters of the english alphabet only.

As the answer can be large, output it modulo 10<sup>9</sup>+7.The first and the only line of input contains an integer N.

Constraints
1 <= N <= 100000Output a single integer, the number of strings of length N satisfying the conditions mentioned in the problem.Sample Input
1

Sample Output
1

Explanation: Only string "a" satisfies the condition.

Sample Input
2

Sample Output
51

Explanation: Strings "aa", "ab",. , "az", "ba", "ca",. , "za" satisfy the condition., I have written this Solution Code: import java.io.*;
import java.util.*;



class Main
{

    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        long ans1=1;
        long ans2=1;
        long ans=0;
        int n = sc.nextInt();
        int m=1000000007;
        for(int i=0;i<n;i++)
        {
           ans1=((ans1)%m*26)%m;
           ans2=((ans2)%m*25)%m;
        }

        ans=(ans1-ans2)%m;
        ans=ans%m <0 ? ans+m:ans;
        System.out.print(ans);



    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?