虽然看了警示后人1和警示后人2，但健忘的蒟蒻还是没有开

而且没见到祖宗

//Problem : P9063 [yLOI2023] 分解只因数
//URL : https://www.luogu.com.cn/problem/P9063
//Limits : 1000 ms And 512 MB
//Compiler : Clion 2023.1.4
//Author : yishanyi
//Compiler : 2024/11/18 20:29

#include<bits/stdc++.h>

using namespace std;

//Macro Definition
#define file freopen("pos.in", "r", stdin), freopen("pos.out", "w", stdout);
#define get getchar()
#define put putchar

//Input Optimization
inline int read() {
    char x = get;
    int n = 0, f = 1;
    while (x < '0' || x > '9') {
        if (x == '-')
            f = -1;
        x = get;
    }
    while (x >= '0' && x <= '9')
        n = n * 10 + x - '0', x = get;
    return n * f;
}

//Output Optimization
inline void print(const string& s) {
    for (char x : s)
        put(x);
    put('\n');
}

//Data Storage
int T;
int n[10];
string ans[10];

//Preparation Ends

inline void Read() {
    T = read();
    for (int i = 1; i <= T; i++)
        n[i] = read();
}

inline void Solve() {
    for (int i = 1; i <= T; i++)
        ans[i] = (n[i] % 2 ? "Yes" : "No");
}

inline auto Print() {
    for (int i = 1; i <= T; i++)
        print(ans[i]);
    return 0;
}

signed main() {
    Read(), Solve();
    return Print();
}

//黑子扶苏！！！

AC记录