For this Question: You are N integers A[1], A[2],. , A[N]. You need to find whether their product is divisible by 4.The first line of input contains a single integer N.
The next line contains N singly spaced integers, A[1], A[2],. , A[N].

Constraints
1 <= N <= 10
1 <= A[i] <= 1000000000Output "YES" if the product is divisible by 4, else output "NO". (without quotes)Sample Input
5
3 5 2 5 1

Sample Output
NO

Explanation: Product = 150 and 150 is not divisible by 4.

Sample Input
4
1 3 8 2

Sample Output
YES

Explanation: Product = 48 and 48 is divisible by 4., I have written this Solution Code: 
import java.util.*;
import java.lang.*;
import java.io.*;

class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc = new Scanner(System.in);
	    
	 
	  int n = sc.nextInt();
	  int a[] = new int[n];
	  for(int i=0;i<n;i++){
	      a[i]=sc.nextInt();
	  }
	  int two=0,four=0;
	  for(int i=0;i<n;i++){
	      if(a[i]%2==0){
	          two++;
	      }
	      if(a[i]%4==0){
	          four++;
	      }
	  }
	  if(four>=1 || two>=2){
	      System.out.print("YES");
	  }
	  else{
	    System.out.print("NO");
	  }

}


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