#include<stdio.h>
#include<stack>
#include<string.h>
#define N 11000
using namespace std;
int main() {
int n,i,k;
char s[N];
scanf("%d",&n);
while(n–) {
stack<char>q;
scanf("%s",s);
k=strlen(s);
for(i=0;s[i];i++) {
if(s[i]=='(‘||s[i]=='[‘)
q.push(s[i]);
else
if(!q.empty()){//有可能当地一个数是‘)’时会越界
if(q.top()=='(‘&&s[i]==’)’)
q.pop();
else
if(q.top()=='[‘&&s[i]==’]’)
q.pop();
else
break;
}
else break;
}
if(k==i&&q.empty())
printf("Yes\n");
else
printf("No\n");
}
return 0;
}