#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




string a;

bool checkRbs(string s){
    int sum = 0;
    for(int i=0; i<s.size(); i++){
        if(s[i] == '(') sum++;
        else sum--;
        if(sum<0) return false;
    }
    return sum == 0;
}

string consistency(int n){

    int op = n/2;
    int cl = n/2;

    vector<int> pos;
    for(int i=0; i<n; i++){
        if(a[i] == '?') pos.push_back(i);
        else if(a[i] == '(') op--;
        else cl--;
    }

    int m = pos.size();
    for(int i=0, open=1; i<m; i++){
        if(open<=op){
            a[pos[i]] = '(';
            open++;
        }
        else{
            a[pos[i]] = ')';
        }
    }


    if(op<=0 || cl <= 0) return "YES";

    swap(a[pos[op-1]], a[pos[op]]);

    if(checkRbs(a)) return "NO";
    return "YES";

}















string practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin >> a;    
    n = a.size();

    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}