#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)
#define Fd(i, a, b) for(int i = a; i >= b; i --)
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;

const int N = 105;

int n;

void sol() {
    string s; cin >> s; n = s.size();
    s = " " + s;
    F(i, 1, n) {
        if(s[i] == '(' || s[i] == ')') s[i] = '(';
        else s[i] = '[';
    }
    if(s[n / 2] != s[n / 2 + 1]) {
        cout << "No\n";
        return;
    }
    F(i, 2, n / 2) if(s[i] == s[i - 1]) {
        cout << "No\n";
        return;
    } 
    F(i, n / 2 + 1, n - 1) if(s[i] == s[i + 1]) {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t; cin >> t;
    F(i, 1, t) sol();
    return 0;
}