Submission #2705864

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <functional>
#include <string>
#include <stack>
#include <set>
using namespace std;
using ll = long long;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, pair<ll, ll>> PP;

const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll INF = 1 << 30;
const ll INF2 = 9e18;
const double INF3 = 9e14;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
const int tx[8] = { -1,0,1,-1,1,-1,0,1 }, ty[8] = { -1,-1,-1,0,0,1,1,1 };
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
#define fr first
#define sc second



int main() {
	int n, a[100010], cnt[3] = { 0 };
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		int c = 0;
		while (true) {
			if (a[i] % 2 == 1)break;
			c++;
			a[i] /= 2;
		}
		if (c == 0)cnt[0]++;
		else if (c == 1)cnt[1]++;
		else cnt[2]++;
	}
	for (int i = 0; i < cnt[0]; i++) {
		cnt[2]--;
	}
	if (!cnt[2]) {
		cout << "No" << endl;
	}
	cout << "Yes" << endl;
	return 0;
}

Submission Info

Judge Result