Submission #1485305

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#define PB push_back
#define MP make_pair
#define sz(v) (in((v).size()))
#define forn(i,n) for(in i=0;i<(n);++i)
#define forv(i,v) forn(i,sz(v))
#define fors(i,s) for(auto i=(s).begin();i!=(s).end();++i)
#define all(v) (v).begin(),(v).end()
using namespace std;
typedef long long in;
typedef vector<in> VI;
typedef vector<VI> VVI;
int main(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  in n;
  cin>>n;
  in n1=0,n2=0,n4=0;
  in a;
  forn(z,n){
    cin>>a;
    if(a%4==0)
      ++n4;
    else if(a%2==0)
      ++n2;
    else
      ++n1;
  }
  n2=min(1LL,n2);
  if(n1<=n4){
    cout<<"Yes"<<endl;
    return 0;
  }
  if(n1==n4+1 && n2==0){
    cout<<"Yes"<<endl;
    return 0;
  }
  cout<<"No"<<endl;
  return 0;
}

Submission Info

Judge Result