Language: C++

#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <set>
#include <cstring>
#include <map>
#include <bitset>
#include <random>
#include <stack>
#include <list>
#include <unordered_set>
#include <unordered_map>
#include <ctime>

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define sc second
#define fs first
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

template<class T> T sqr(T x) { return x*x; }
ld pi = 3.1415926535897932384626433832795;
ll mod = 1e9 + 7;
const int N = 2e5 + 10;

typedef vector<vector<ll> > mtrx;

ll gcd(ll a, ll b) {
	return b ? gcd(b, a % b) : a;
}



int main() {
	int n, k, ost2 = 0, ost4 = 0;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		if (a % 4 == 0)
			ost4 += 1;
		else if (a % 2 == 0)
			ost2 += 1;
	}
	bool ok = 0;
	if (ost4)
		if (ost4 * 2 + 1 >= n) ok = 1;
	if (ost4)
		if (ost4 * 2 + 1 + ost2 >= n && ost2 > 1) ok = 1;
	if (ost2 == n) ok = 1;
	if (ok)
		cout << "Yes";
	else cout << "No";
	return 0;
}#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <set>
#include <cstring>
#include <map>
#include <bitset>
#include <random>
#include <stack>
#include <list>
#include <unordered_set>
#include <unordered_map>
#include <ctime>

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define sc second
#define fs first
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

template<class T> T sqr(T x) { return x*x; }
ld pi = 3.1415926535897932384626433832795;
ll mod = 1e9 + 7;
const int N = 2e5 + 10;

typedef vector<vector<ll> > mtrx;

ll gcd(ll a, ll b) {
	return b ? gcd(b, a % b) : a;
}



int main() {
	int n, k, ost2 = 0, ost4 = 0;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		if (a % 4 == 0)
			ost4 += 1;
		else if (a % 2 == 0)
			ost2 += 1;
	}
	bool ok = 0;
	if (ost4)
		if (ost4 * 2 + 1 >= n) ok = 1;
	if (ost4)
		if (ost4 * 2 + ost2 >= n && ost2 > 1) ok = 1;
	if (ost2 == n) ok = 1;
	if (ok)
		cout << "Yes";
	else cout << "No";
	return 0;
}

Compiler output:
a.cc:63:2: error: stray '#' in program
   63 | }#include <iostream>
      |  ^
a.cc:63:3: error: 'include' does not name a type
   63 | }#include <iostream>
      |   ^~~~~~~
a.cc:91:21: error: redefinition of 'template<class T> T sqr(T)'
   91 | template<class T> T sqr(T x) { return x*x; }
      |                     ^~~
a.cc:29:21: note: 'template<class T> T sqr(T)' previously declared here
   29 | template<class T> T sqr(T x) { return x*x; }
      |                     ^~~
a.cc:92:4: error: redefinition of 'long double pi'
   92 | ld pi = 3.1415926535897932384626433832795;
      |    ^~
a.cc:30:4: note: 'long double pi' previously defined here
   30 | ld pi = 3.1415926535897932384626433832795;
      |    ^~
a.cc:93:4: error: redefinition of 'long long int mod'
   93 | ll mod = 1e9 + 7;
      |    ^~~
a.cc:31:4: note: 'long long int mod' previously defined here
   31 | ll mod = 1e9 + 7;
      |    ^~~
a.cc:94:11: error: redefinition of 'const int N'
   94 | const int N = 2e5 + 10;
      |           ^
a.cc:32:11: note: 'const int N' previously defined here
   32 | const int N = 2e5 + 10;
      |           ^
a.cc:98:4: error: redefinition of 'long long int gcd(long long int, long long int)'
   98 | ll gcd(ll a, ll b) {
      |    ^~~
a.cc:36:4: note: 'long long int gcd(long long int, long long int)' previously defined here
   36 | ll gcd(ll a, ll b) {
      |    ^~~
a.cc:104:5: error: redefinition of 'int main()'
  104 | int main() {
      |     ^~~~
a.cc:42:5: note: 'int main()' previously defined here
   42 | int main() {
      |     ^~~~