#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;

const int N = 1e5;

	int n, a[N + 3];
	char s[N + 3];
	
bool isbra(char ch){
	return ch == '(' || ch == ')' || ch == '[' || ch == ']';
}
	
void sol(){
	n = 1;
	while(isbra(s[n] = getchar()))
		n++;
	s[n] = '\0';
	n--;
	
	for(int i = 1; i <= n; i++)
		a[i] = (s[i] == '(' || s[i] == ')')?0:1;
	
	bool flag = true;
	for(int i = 1; flag && i + i <= n; i++){
		if(a[i] != a[n - i + 1])
			flag = false;
		if(i % 2 == 1 && a[i] != a[1])
			flag = false;
		if(i % 2 == 0 && a[i] == a[1])
			flag = false;
	}
	
	printf("%s\n", flag?"Yes":"No");
	
}

int main(){
	int T;
	scanf("%d\n", &T);
	while(T--)
		sol();

	return 0;

}