#include<bits/stdc++.h>
using namespace std;
const int N=1000010;
typedef long long LL;
LL a,b,c,d,n,m,idx,ans,e[N],ne[N],h[N];
string z;
int dp(int u)
{
    int p=0;
    if(u+1>=z.size())
    {
        idx=0;
        return u+1;
    }
    if(e[u+1]==e[u])
    {
        return u+1;
    }
    else{
        p=dp(u+1);
        if(e[p+1]==e[u])
        {
            return p+1;
        }
        else {
            idx=0;
            return p+1;
        }
    }
}
void solve()
{
    cin>>z;a=0;
    z="";a=0;
    memset(e,0,sizeof e);ne[1]=0;ne[0]=0;idx=1;
    for(int i=1;i<=z.size();i++)
    {
        if(z[i-1]=='('||z[i-1]==')')
        e[i]=1;
    }
    a=dp(1);
    while(a<z.size()&&idx==1)
    {
        ne[e[a]]++;
        if(ne[e[a]]==2)
        {
            idx=0;
            break;
        }
        else a=dp(a+1);
    }
    if(idx==0)
    {
        cout<<"No"<<endl;
    }
    else cout<<"Yes"<<endl;
}
int main()
{
    LL N=1;
    cin>>N;
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    while(N--)
    {
        solve();
    }
    return 0;
}