#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
using i64 = long long;
map<char, int> mp;
void solve()
{
    string s;
    cin >> s;
    stack<char> st;
    string ss = "";
    int flag = 0;
    int cnt = 0;
    for (int i = 0; i < s.size(); i++)
    {
        if (st.empty())
        {
            st.push(s[i]);
            continue;
        }
        if (st.top() == '(' || st.top() == ')')
        {
            if (s[i] == '[' || s[i] == ']')
            {
                if (flag)
                {
                    cout << "No\n";
                    return;
                }
                st.push(s[i]);
            }
            else
            {
                flag = 1;
                st.pop();
            }
        }

        else if (st.top() == '[' || st.top() == ']')
        {

            if (s[i] == '(' || s[i] == ')')
            {
                if (flag)
                {
                    cout << "No\n";
                    return;
                }
                st.push(s[i]);
            }
            else
            {
                flag = 1;
                st.pop();
            }
        }

        if (st.size() == 0)
        {
            cnt++;
            flag = 0;
            ss.push_back(s[i]);
        }
    }
    // cout << ss.size() << endl;
    // cout << ss << endl;
    if (ss.size() > 2)
    {
        cout << "No\n";
    }
    else if (ss.size() == 2 && mp[ss[0]] == mp[ss[1]])
    {
        cout << "No\n";
    }
    else
    {
        cout << "Yes\n";
    }
}
int main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    mp['('] = mp[')'] = 0;
    mp['['] = mp[']'] = 1;
    int T = 1;
    cin >> T;
    while (T--)
        solve();
    //system("pause");
    return 0;
}