#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define range(x) (x).begin(), (x).end()
const int dir[][2] = {1, 0, -1, 0, 0, 1, 0, -1};

void solve()
{
    string s;
    cin >> s;
    int n = s.size();
    vector<int> v;
    for (const auto &c : s) {
        if (c == '(' || c == ')')
            v.push_back(0);
        else
            v.push_back(1);
    }

    vector<int> vis(n);
    int tag[2] = {0};
    for (int i = 0; i < n - 1; ++i) {
        if (v[i] == v[i + 1] && !vis[i] && !vis[i + 1]) {
            int l = i, r = i + 1;
            int flag = v[i];
            while (l >= 0 && r < n && !vis[l] && !vis[r] && v[l] == v[r] && v[l] == flag) {
                vis[l] = vis[r] = 1;
                flag ^= 1;
                l--, r++;
            }

            if (l >= 0 && r < n) {
                // cout << l << ' ' << r << ' ' << flag << '\n';
                cout << "No\n";
                return;
            }
            tag[flag]++;
        }
    }

    if (tag[0] < 2 && tag[1] < 2)
        cout << "Yes\n";
    else
        cout << "No\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}