#include <iostream>
#include <string>
#include <vector>
const int N = 1e6 + 10;
char stack[N];
int cnt = 0;
using namespace std;
inline int t_c(char c)
{
    if(c == '(' || c == ')') return 0;
    else return 1;
}
inline char cg(char c)
{
    if(c == '(') return ')';
    if(c == '[') return ']';
    if(c == ']') return '[';
    if(c == ')') return '(';
    cout << "e:" << c << endl;
    return '%';
}
void solve()
{
    cnt = 0;
    string s;
    cin >> s;
    for(int i = 0; i < s.size(); ++ i)
    {
        if(cnt == 0)
        {
            if(s[i] == ')' || s[i] == ']') s[i] = cg(s[i]);
            stack[cnt ++] = s[i];
        }
        else if(t_c(stack[cnt - 1]) == t_c(s[i]))
        {
            s[i] = cg(stack[cnt - 1]);
            -- cnt;
        }
        else
        {
            if(s[i] == ')' || s[i] == ']') s[i] = cg(s[i]);
            stack[cnt ++] = s[i];
        }
    }

    cnt = 0;
    int layer = 0;
    bool v[N][2];
    for(int i = 0; i < s.size(); ++ i)
        v[i][0] = false, v[i][1] = false;

    for(int i = 0; i < s.size(); ++ i)
    {
        if(s[i] == '(' || s[i] == '[')
        {
            ++ layer;
            if(v[layer][t_c(s[i])] == true)
            {
                printf("No\n");
                return;
            }
            v[layer][t_c(s[i])] = true;
        }
        else
        {
            v[layer + 1][0] = false, v[layer + 1][1] = false;
            -- cnt, -- layer;
        }
    }
    printf("Yes\n");
}

int main()
{
    int CASE;
    cin >> CASE;
    while(CASE --){
        solve();
    }
    return 0;
}