For this Question: Given an array A of integers, find the number of subarrays with an odd sum.First line contains an integers N.
Next line contains N space separated integers denoting elements of array.

Constraints
1 <= N <= 10^5
1 <= Ai <= 10^5Print the number of subarrays with an odd sum.Sample Input 1:
3
1 3 5

Output 
4

Explanation: 
All subarrays are [1], [1, 3], [1, 3, 5], [3], [3, 5], [5]
All sub- arrays sum are [1, 4, 9, 3, 8, 5].
Odd sums are [1, 9, 3, 5] so the answer is 4.

Sample Input 2:
3
2 4 6

Output 
0

Explanation: 
All subarrays are [2], [2, 4], [2, 4, 6], [4], [4, 6], [6]
All sub- arrays sum are [2, 6, 12, 4, 10, 6].
All sub- arrays have even sum and the answer is 0., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main
{
    public static void main (String args[]) throws IOException
    {   
        BufferedReader br = new BufferedReader (new InputStreamReader(System.in));
    	int n=Integer.parseInt(br.readLine());
    	long a[] = new long[n];
        String line = br.readLine(); // to read multiple integers line
        String[] strs = line.trim().split("\\s+");
        for (int i = 0; i < n; i++) {
            a[i] = Long.parseLong(strs[i]);
        }
        long[] prefix=new long[n];
        prefix[0]=a[0];
        for(int i=1;i<n;i++){
            prefix[i]=prefix[i-1]+a[i];
        }
        long e=1;
        long o=0;
        for(int i=0;i<n;i++){
            if(prefix[i]%2==0)e++;
            else o++;
        }
        e*=o;
    	System.out.print(e);
    }
}

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