#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int check(char c) {
    if (c == '(' || c == ')') {
        return 1;
    } else {
        return -1;
    }
}

void solve() {
    string s;
    cin >> s;

    int ok = 1;

    int n = s.size();

    for (int i = 0; i < n - 2; i++) {
        if (check(s[i]) == check(s[i + 1]) && check(s[i]) == check(s[i + 2])) {
            ok = 0;
        }
    }

    if (!ok) {
        cout << "No\n";
        return;
    }

    vector<pair<int, int>> pre(n + 1);
    for (int i = 0; i < n; i++) {
        int f = check(s[i]);
        if (f == 1) {
            pre[i + 1].first = pre[i].first + 1;
            pre[i + 1].second = pre[i].second;
        } else {
            pre[i + 1].second = pre[i].second + 1;
            pre[i + 1].first = pre[i].first;
        }
    }

    set<pair<int, int>> st1, st2;
    for (int i = 0; i < n - 1; i++) {
        int f1 = check(s[i]), f2 = check(s[i + 1]);
        if (f1 == f2) {
            if (f1 == 1) {
                int t1 = pre[i].first % 2, t2 = pre[i].second % 2;
                if (st1.count(make_pair(t1, t2))) {
                    ok = 0;
                } else {
                    st1.insert(make_pair(t1, t2));
                }
            } else {
                int t1 = pre[i].first % 2, t2 = pre[i].second % 2;
                if (st2.count(make_pair(t1, t2))) {
                    ok = 0;
                } else {
                    st2.insert(make_pair(t1, t2));
                }
            }
        }
    }

    if (!ok) {
        cout << "No\n";
        return;
    }

    cout << "Yes\n";
}

int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}