Problem:
Score : 400 points

Problem Statement

We have a sequence of length N, a = (a_1, a_2, ..., a_N).
Each a_i is a positive integer.

Snuke's objective is to permute the element in a so that the following condition is satisfied:

For each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.

Determine whether Snuke can achieve his objective.

Constraints

2 ≤ N ≤ 10^5

a_i is an integer.

1 ≤ a_i ≤ 10^9

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 ... a_N

Output

If Snuke can achieve his objective, print Yes; otherwise, print No.

Sample Input 1

3
1 10 100

Sample Output 1

Yes

One solution is (1, 100, 10).

Sample Input 2

4
1 2 3 4

Sample Output 2

No

It is impossible to permute a so that the condition is satisfied.

Sample Input 3

3
1 4 1

Sample Output 3

Yes

The condition is already satisfied initially.

Sample Input 4

2
1 1

Sample Output 4

No

Sample Input 5

6
2 7 1 8 2 8

Sample Output 5

Yes

Solution in C (GCC 5.4.1) (judge verdict: Runtime Error)

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
bool is_right(long long int *p,long long int n,long long int i);
int main(void)
{
   long long int n,i;
   scanf("%d",&n);
    long long int a[n];
   for(i=0;i<n;i++)
    scanf("%d",&a[i]);
    for(i=0;i<n;i++)
    {if((a[i]*a[i+1])%4!=0&&is_right(a,n,i)==0)
      {printf("No"); exit(0);}
    }
     printf("Yes");

}
 bool is_right(long long int *p,long long int n,long long int i)
{
  long long int top,k=0,j=1;
   if(i==n-2)
  {
    while (p[i]*p[i+1]%4!=0&&k<n-3)
    {
      if(p[i+1]*p[j]%4==0){
        top=p[i+1];
        p[i+1]=p[k];
        p[k]=top;
         k++;
        }
    }
  if(p[i]*p[i+1]%4==0) return true;
  else return false;
}
 else{
    while((p[i]*p[i+1])%4!=0&&k<n-i-1)
 {
        top=p[i+1];
        p[i+1]=p[i+j+1];
        p[i+j+1]=top;
        j++;
        k++;
 }
 if(p[i]*p[i+1]%4==0) return true;
   else false;
 }
}