#include <iostream>
#include <string>
#include <bitset>
#include <stack>
#include <deque>

using namespace std;

struct seq
{
    int l, r, t;
};

string s;
bitset<1000010> bin_s;

bool solve(int l, int r)
{
    if (l >= r)
        return true;
    deque<seq> seqs;
    stack<char> ord;
    int index = 0;
    for (int i = l; i <= r; i++)
    {
        if (bin_s[i])
        {
            if (ord.size() && ord.top() == '[')
                ord.pop();
            else
                ord.push('[');

            if (ord.empty())
            {
                seqs.emplace_back();
                seqs.back().r = i;
                seqs.back().t = 1;
            }
        }
        else
        {
            if (ord.size() && ord.top() == '(')
                ord.pop();
            else
                ord.push('(');

            if (ord.empty())
            {
                seqs.emplace_back();
                seqs.back().r = i;
                seqs.back().t = 1;
            }
        }
    }
    if (seqs.empty())
        return true;
    seqs.front().l = 0;
    auto p1 = seqs.begin(), p2 = p1 + 1;
    while (p2 != seqs.end())
    {
        p2->l = p1->r + 1;
        p1++, p2++;
    }

    int cnts[2] = {0, 0};
    for (auto &p : seqs)
        cnts[p.t]++;

    if (cnts[0] > 1 || cnts[1] > 1)
        return false;

    for (auto &x : seqs)
        if (solve(x.l + 1, x.r - 1))
            return true;

    return true;
}

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> s;
        n = s.size();
        for (int i = 0; i < n; i++)
        {
            if (s[i] == '(' || s[i] == ')')
                bin_s[i] = 0;
            else
                bin_s[i] = 1;
        }

        if (solve(0, n - 1))
            cout << "Yes\n";
        else
            cout << "No\n";
    }

    return 0;
}