#include <algorithm>
#include <iostream>
#include <string>
int main() {
    int t, length, half;
    bool ans;
    std::string s, tmp_s, reversed_s;
    std::cin >> t;
    for (int i = 0; i < t; i++) {
        std::cin >> s;
        length = s.size();
        half = length >> 1;
        tmp_s = s;
        std::replace(tmp_s.begin(), tmp_s.end(), '(', 'r');
        std::replace(tmp_s.begin(), tmp_s.end(), ')', 'r');
        std::replace(tmp_s.begin(), tmp_s.end(), '[', 's');
        std::replace(tmp_s.begin(), tmp_s.end(), ']', 's');
        if (length % 2 == 1 || length <= 2) {
            std::cout << "Yes" << std::endl;
            continue;
        }
        reversed_s = tmp_s.substr(half, length);
        std::reverse(reversed_s.begin(), reversed_s.end());
        ans = tmp_s.substr(0, half) == reversed_s;
        if (ans) {
            ans = tmp_s.substr(0, half).find("ss") != std::string::npos ||
                  tmp_s.substr(0, half).find("rr") != std::string::npos;
        } else {
            ans = tmp_s.substr(0, half).find("ssss") != std::string::npos ||
                  tmp_s.substr(0, half).find("rrrr") != std::string::npos;
        }
        if (ans) {
            std::cout << "No" << std::endl;
        } else {
            std::cout << "Yes" << std::endl;
        }
    }
    return 0;
}