#include <iostream>
#include <iomanip>
#include <cmath>
#include <climits>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <set>
#include <map>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <stack>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;

const int N = 1e5 + 1;

char str[N + 1];
bool c[CHAR_MAX], a[N];

void solve() {
    scanf("%s", str + 1);
    int len = (int)strlen(str + 1);
    for (int i = 1; i <= len; ++i) {
        a[i] = c[str[i]];
    }
    vector<bool> stk;
    for (int i = 1; i <= len; ++i) {
        if (!stk.empty() && stk.back() == a[i]) {
            stk.pop_back();
        } else {
            stk.push_back(a[i]);
        }
    }
    if (!stk.empty()) {
        puts("No");
        return ;
    }
    for (int i = 1; i <= len - 2; ++i) {
        if (a[i] == a[i + 1] && a[i + 1] == a[i + 2]) {
            puts("No");
            return ;
        }
    }
    int cnt0 = 0, cnt1 = 0;
    for (int i = 1; i <= len - 1; ++i) {
        if (a[i] == 0 && a[i + 1] == 0) {
            if (++cnt0 >= 2) {
                puts("No");
                return ;
            }
        } else if (a[i] == 1 && a[i + 1] == 1) {
            if (++cnt1 >= 2) {
                puts("No");
                return ;
            }
        }
        ++i;
    }
    puts("Yes");
}

int main(int argc, const char * argv[]) {
    c['['] = c[']'] = false;
    c['('] = c[')'] = true;
    
    int T;
    scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}