#include<bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ull = unsigned long long;
using ld = long double;

template<class T>
bool chmin(T &a, T b) {
    if(a <= b) return false;
    a = b;
    return true;
}

template<class T>
bool chmax(T &a, T b) {
    if(a >= b) return false;
    a = b;
    return true;
}

using namespace std;

void solve(){
    string s; cin >> s;
    int n = s.size();
    vector<int> a(n);
    rep(i,0,n){
        if (s[i] == '(' || s[i] == ')') a[i] = 0;
        else a[i] = 1;
    }

    vector<int> cnt(n);
    vector rui(2, vector<int>(n+1));
    rep(i,0,n){
        if (i & 1){
            rui[a[i]][i+1] -= 1;
        }else{
            rui[a[i]][i+1] += 1;
        }
    }
    rep(i,0,n){
        rui[0][i+1] += rui[0][i];
        rui[1][i+1] += rui[1][i];
    }

    auto sum = [&](int l, int r) -> pair<int,int> {
        return {rui[0][r] - rui[0][l], rui[1][r] - rui[1][r]};
    };

    auto plus = [&](pair<int,int> A, pair<int,int> B) -> pair<int,int> {
        return {A.first + B.first, A.second + B.second};
    };

    
    {
        map<pair<pair<int,int>,pair<int,int>>, int> mp;
        for (int i=0; i<n; i++){
            pair<int,int> t1 = sum(0, i);
            pair<int,int> t2 = sum(0, i + 1);
            cnt[i] += mp[pair(t1, t2)];
            mp[pair(sum(0, i+1), sum(0, i))] += 1;
        }
    }
    {
        map<pair<pair<int,int>,pair<int,int>>, int> mp;
        for (int i=n-1; i>=0; i--){
            pair<int,int> t1 = sum(0, i + 1);
            pair<int,int> t2 = sum(0, i);
            cnt[i] += mp[pair(t1, t2)];
            mp[pair(sum(0, i), sum(0, i + 1))] += 1;
        }
    }
    rep(i,0,n){
        //cout << i << ' ' << cnt[i] << '\n';
        if (cnt[i] != 1){
            cout << "No\n";
            return;
        }
    }
    cout << "Yes\n";
    return;
    
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int t; cin >> t; while(t--) solve();
}