#include <bits/stdc++.h>
#define int long long
#define io ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb push_back
using namespace std;
const int N=1e6+5,mod1=1e9+7,mod2=998244353;
typedef pair<int,int> pi;
int a[N];
int x[N],y[N];
void solve()
{
string s;
cin>>s;
int n=s.length();
s=' '+s;
for(int i=1;i<=n;i++)
{
if(s[i]==')')s[i]='(';
if(s[i]==']')s[i]='[';
}
if(n%2==1)
{
cout<<"No"<<'\n';
return ;
}
if(n==2)
{
if(s[1]==s[2])cout<<"Yes"<<'\n';
else cout<<"No";
return ;
}
int ans=0;
for(int i=1;i<=n;i++)
{
if(s[i]==s[i-1])ans++;
if(i>2)
{
if(s[i]==s[i-1]&&s[i-1]==s[i-2])
{
cout<<"No"<<'\n';
return ;
}
}
if(i>3)
{
if(s[i]==s[i-1]&&s[i-1]==s[i-2]&&s[i-2]==s[i-3])
{
cout<<"No"<<'\n';
return ;
}
}
x[i]=x[i-1],y[i]=y[i-1];
if(s[i]=='(')x[i]++;
else y[i]++;
}
if(ans>2)
{
cout<<"No"<<'\n';
return ;
}
int ans=0;
int l=1;
for(int i=l+1;i<=n;i++)
{
if(s[i]==s[l]&&x[i]%2==0&&y[i]%2==0)
{
l=i+1;
ans++;
break;
}
}
if(s[l]==s[l-1])
{
cout<<"No"<<'\n';
return ;
}
for(int i=l+1;i<=n;i++)
{
if(s[i]==s[l]&&(x[i]-x[l-1])%2==0&&(y[i]-y[l-1])%2==0)
{
l=i+1;
ans++;
break;
}
}
if(l==n+1)cout<<"Yes";
else cout<<"No";
cout<<'\n';
}
signed main()
{
io;
int t=1;
cin>>t;
while(t--)
{
solve();
}
return 0;
}