#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n,mth[N];
int stk[N],top;
int a[N];
int has[N][2];
inline void work() {
	string s;
	cin >> s;n = s.size();
	for(int i = 1;i <= n;i++) {
		char ch = s[i - 1];
		if(ch == '(' || ch == ')') a[i] = 0;
		else a[i] = 1;
	}
	top = 0;
	for(int i = 1;i <= n;i++)
		if(!top || a[stk[top]] != a[i]) stk[++top] = i;
		else mth[stk[top]] = i,mth[i] = stk[top],--top;
	for(int i = 0;i <= n;i++) has[i][0] = has[i][1] = 0;
	for(int i = 2;i <= n;i++) {
		if(i < mth[i] && has[i - 1][a[i]]) return puts("No"),void();
		has[i][0] = has[mth[i] - 1][0];has[i][1] = has[mth[i] - 1][1];
		if(mth[i] < i) has[i][a[i]] = true;
	}
	puts("Yes");
}
int main() {
	int T;
	cin >> T;
	while(T--) work();
	return 0;
}