#include <iostream>
#include <string>
#include <unordered_set>

using namespace std;

// 1st scan: ()() <--- not gonna work, as it can become (())

void fixPair(string& input, char cA, char cB) {
    int pA = 0, pB = input.size() - 1;
    while(pA <= pB) {
        bool pAOK = input[pA] == cA || input[pA] == cB;
        bool pBOK = input[pB] == cA || input[pB] == cB;
        
        if(pAOK && pBOK) {
            input[pA] = cA;
            input[pB] = cB;
            pA++;
            pB--;
        }
        
        if(!pAOK) {
            pA++;
        }
        if(!pBOK) {
            pB--;
        }
    }
}

void run(string& input, unordered_set<string>& used) {
    int pA = 0, pB = input.size() - 1;
    
    // fix the pair to perfect first.
    fixPair(input, '(', ')');
    fixPair(input, '[', ']');
    
    // cout << "Fix input " << input << endl;
    
    if(used.count(input) || input.find("((") != string::npos || input.find("[[") != string::npos || input.find(")(") != string::npos || input.find("][") != string::npos) {
        cout << "No" << endl;
    } else {
        cout << "Yes" << endl;
    }
    
    used.insert(input);
}

int main()
{
    int caseNum;
    cin >> caseNum;
    
    string input;
    unordered_set<string> used;
    
    getline(cin, input);
    for(int i=0; i < caseNum; i++) {
        getline(cin, input);
        run(input, used);
    }
    return 0;
}