#include<iostream>
#include<algorithm>
#include<vector>
#include<fstream>
using namespace std;
ifstream fin("adorable.in");
ofstream fout("adorable.out");

string s;
int t;
vector <int> v;
vector <bool> otg;

int main() {
    fin >> t;
    for (int i=0; i<t; i++) {
        fin >> s;
        int n = s.size();
        sort(s.begin(), s.end());
        v.push_back(1);
        int l = 0;
        for (int j=1; j<n; j++) {
            if (s[j] != s[j - 1]) { v.push_back(1); l++; continue; }
            else v[l]++;
        }
        int nn = v.size();
        if (nn == 1) otg.push_back(false);
        if (nn == 2) {
            if (s.size() >= 4 && v[0] != 1 && v[1] != 1) otg.push_back(true);
            else otg.push_back(false);
        }
        if (nn == 3) {
            if (v[0] == 1 && v[1] == 1 && v[2] == 1) otg.push_back(false);
            else otg.push_back(true);
        }
        if (nn == 4) otg.push_back(true);
        if (nn > 4) otg.push_back(false);
        v.clear();
    }

    int n = otg.size();
    for (int i=0; i<n; i++) {
        if (otg[i] == true) fout << "Yes" << endl;
        else fout << "No" << endl;
    }
    return 0;
}