#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int T,n;
char s[100005];
int pos[100005];

int fail;
vector <int> sta;
void solve(int l,int r){
	if(l > r) return;
	if(pos[l] == r){
		solve(l + 1,r - 1);
		return;
	}
	if(s[pos[l] + 1] == s[l] || pos[pos[l] + 1] != r){
		fail = 1;
		return;
	}
	solve(l,pos[l]);
	solve(pos[l] + 1,r);
}

void solve(){
	scanf("%s",s + 1);
	n = strlen(s + 1);
	rep(i,1,n){
		if(s[i] == '[' || s[i] == ']') s[i] = '0';
		else s[i] = '1';
	}
	sta.clear();
	rep(i,1,n){
		if(!sta.empty() && s[sta.back()] == s[i]){
			pos[sta.back()] = i;
			pos[i] = sta.back();
			sta.pop_back();
		}else{
			sta.eb(i);
		}
	}
	assert(sta.empty());
	fail = 0;
	solve(1,n);
	if(fail) printf("No\n");
	else printf("Yes\n");
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}