Neliöt

#include <bits/stdc++.h>

typedef long long ll;

#define M 1000000007

using namespace std;

void test_case() {
	int n;
	cin >> n; 
     
    map<int, int> d;

    int div = 2;
    while (n > 1) {
        if (div * div > n) {
            d[n]++;
            break;
        }

        if (n % div == 0) {
            d[div]++;
            n /= div;
            div = 1;
        } 
        div++;
    }

    for (auto it = d.begin(); it != d.end(); it++) {
        if (it->first % 4 == 3) {
            if (it->second & 1) {
                cout << "NO\n";
                return;
            }
        }
    }
    cout << "YES\n";
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int t;
	cin >> t;
	for (int i = 0; i < t; ++i) {
		test_case();
		//cout << "\n";
	}

	return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED