题解 | #小红的01串#

#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <numeric>
#include <ctime>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
using ll = long long;

const ll N = 5e5 + 5, mod = 1e9 + 7, inf = 2e18;
const double esp = 1e-8;

void solve() {
    string a;
    cin >> a;

    int zero = count(a.begin(), a.end(), '0');
    int one = a.size() - zero;

    cout << ((zero & 1) && (one & 1) ? "No" : "Yes") << '\n';
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int t = 1;
    cin >> t;

    while (t--) {

        solve();

    }

    return 0;
}