#include<bits/stdc++.h>
// #define ONLINE_JUDGE
#define INPUT_DATA_TYPE int
#define OUTPUT_DATA_TYPE int
inline __attribute((always_inline)) INPUT_DATA_TYPE read(){register INPUT_DATA_TYPE x=0;register char f=0,c=getchar();while(c<'0'||'9'<c)f=(c=='-'),c=getchar();while('0'<=c&&c<='9')x=(x<<3)+(x<<1)+(c&15),c=getchar();return f?-x:x;}void print(OUTPUT_DATA_TYPE x){if(x<0)x=-x,putchar('-');if(x>9)print(x/10);putchar(x%10^48);return;}

char s[1000010];
int nxt[1000010],flg;

void dfs(int l,int r){
	if(l+1==r) return;
	register int i,cnt[2]={0,0};
	for(i=l+1;i<r;++i){
		++cnt[s[i]];
		dfs(i,nxt[i]);
		i=nxt[i];
	}
	if(cnt[0]>1||cnt[1]>1) flg=1;
	return;
}

void solve(){
	std::stack<int> S;
	register int i;
	scanf("%s",s);
	int n=strlen(s);
	for(i=n;i;--i) s[i]=s[i-1];
	for(i=1;i<=n;++i){
		if(s[i]=='('||s[i]==')') s[i]=0;
		else s[i]=1;
	}

	for(i=1;i<=n;++i){
		if(!S.empty()&&s[i]==s[S.top()]){
			nxt[S.top()]=i;
			S.pop();
		}else S.push(i);
	}

	flg=0;
	dfs(0,n+1);

	puts(flg?"No":"Yes");
}

int main(){
	#ifndef ONLINE_JUDGE
	freopen("name.in", "r", stdin);
	freopen("name.out", "w", stdout);
	#endif

	int T=read();
	while(T--) solve();

	#ifndef ONLINE_JUDGE
	fclose(stdin);
	fclose(stdout);
	#endif
    return 0;
}