#include <bits/stdc++.h>
using namespace std;

void solve() {
    int n; cin >> n;
    vector<int> d;
    for (int i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            d.push_back(i);
            if (n / i != i) d.push_back(n / i);
        }
    }
    for (int i = 0; i < d.size(); i++) {
        for (int j = i + 1; j < d.size(); j++) {
            for (int k = j + 1; k < d.size(); k++) {
                for (int l = k + 1; l < d.size(); l++) {
                    if ((d[i] + d[j] + d[k] + d[l]) % n == 0) {
                        cout << "Yes" << "\n";
                        return;
                    }
                }
            }
        }
    }
    cout << "No" << "\n";
}

int main() {
    int t; cin >> t;
    while (t--) solve();
}

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n, k, x; cin >> n >> k >> x;
    int col[n] = {};
    for (int i = 1, mov = 1; i <= n; i++) {
        int a[n] = {};
        for (int j = 0; j < n; j++)
            cin >> a[j];
        if (i & 1) {
            rotate(a, a + n - mov, a + n);
            fill(a, a + mov, x);
            if (++mov == k + 1) mov = 1; 
        }
        for (int j = 0; j < n; j++)
            col[j] += a[j];
    }
    for (int i = 0; i < n; i++)
        cout << col[i] << " \n"[i == n - 1];
}

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n; cin >> n;
    int h[n] = {};
    for (int i = 0; i < n; i++)
        cin >> h[i];
    int l[n] = {};
    for (int i = 0; i < n; i++)
        cin >> l[i];
    int ans = -1, del = INT_MAX;
    for (int dia = 1; dia <= 1000; dia++) {
        for (int st = 0; st <= 1000; st++) {
            int mx = *max_element(l, l + n);
            int mi = *min_element(h, h + n);
            if (mx > st or mi < st + dia)
                del = min(del, max(0, mx - st) + max(0, st + dia - mi));
            else 
                ans = max(ans, dia);
        }
    }
    cout << (ans != -1 ? "Yes " : "No ")
         << (ans != -1 ? ans : del) << "\n";
}

#include <bits/stdc++.h>
using namespace std;

bool isprime(int n) {
    if (n < 2) return false;
    for (int i = 2; i * i <= n; i++)
        if (n % i == 0) return false;
    return true;
}

bool ok(int n) {
    return isprime(n) and (isprime(n - 6) or isprime(n + 6));
}

int main() {
    int n; cin >> n;
    if (ok(n)) {
        cout << "Yes" << "\n"
             << (isprime(n - 6) ? n - 6 : n + 6);
    } else {
        cout << "No" << "\n";
        for (int i = n + 1; true; i++) {
            if (ok(i)) {
                cout << i << "\n";
                return 0;
            }
        }
    }
}

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n; cin >> n;
    map<string, bool> mp;
    for (int i = 0; i < n; i++) {
        string s; cin >> s;
        mp[s] = true;
    }
    int ans = 0;
    set<string> st1, st2;
    map<string, string> mp1, mp2;
    int m; cin >> m;
    for (int i = 0 ; i < m; i++) {
        string s; cin >> s;
        string t = s.substr(6, 8);
        if (mp[s]) {
            ++ans;
            st1.insert(t);
            mp1[t] = s;
        } else {
            st2.insert(t);
            mp2[t] = s;
        }
    }
    cout << ans << "\n"
         << (ans > 0 ? mp1[*st1.begin()] : mp2[*st2.begin()]) << "\n";
}