#include<bits/stdc++.h>

#define ull unsigned long long
#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

mt19937_64 gen(time(0));

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 1e5 + 5;

int n, ans, a[N], topf, stk[N];
ull b[N], sum;
vc<ull> hs[2];
char str[N];

inline void testcase() {
	scanf("%s", str + 1); n = strlen(str + 1);
	rep(i, 1, n) a[i] = ( str[i] == '(' || str[i] == ')' ) ? 0 : 1, b[i] = gen();
	
	topf = sum = 0; hs[0].clear(); hs[1].clear();
	rep(i, 1, n) {
		if(topf && a[stk[topf]] == a[i]) 
			sum -= b[stk[topf]], --topf, hs[a[i]].pb(sum);
		else stk[++topf] = i, sum += b[i];
	}
	assert(topf == 0);
	
	ans = 0;
	rep(i, 0, 1) if(hs[i].size()) {
		sort(hs[i].begin(), hs[i].end());
		int len = hs[i].size();
		rep(j, 0, len - 2) ans |= hs[i][j] == hs[i][j + 1];
	}
	puts(ans ? "No" : "Yes");
}

signed main() {
	int t = read(); while(t--) testcase(); 
	return 0;
}