#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int Mod = 998244353;
using ll = long long;
int a[100010];
void solve()
{
    string s;
    cin >> s;
    int n = s.size();
    for (int i = 0; i < n; i++)
    {
        if (s[i] == '(' || s[i] == ')')
            a[i] = 1;
        else
            a[i] = 0;
    }
    bool flag = true;
    if (a[0] == a[n - 1])
    {
        for (int i = 0; i < n / 2 - 1; i++)
        {
            if (a[i] == a[i + 1])
                flag = false;
        }
        for (int i = n / 2; i < n - 1; i++)
        {
            if (a[i] == a[i + 1])
                flag = false;
        }
        if (flag)
            cout << "Yes\n";
        else
            cout << "No\n";
    }
    else
    {
        int i = 0;
        while (a[i] != a[i + 1])
            i++;
        i++;
        // cout << i;
        int p = (i - 1) + i;
        // cout << p << "\n";
        for (i; i < p; i++)
            if (a[i] == a[i + 1])
                flag = false;
        i++;
        if (a[i] == a[0])
            flag = false;
        // cout << i << "\n";
        p = (i + n - 1) / 2;
        // cout << p << "\n";
        for (i; i < p; i++)
            if (a[i] == a[i + 1])
                flag = false;
        i++;
        // cout << i << "\n";
        for (i; i < n - 1; i++)
            if (a[i] == a[i + 1])
                flag = false;
        if (flag)
            cout << "Yes\n";
        else
            cout << "No\n";
    }
}
int main()
{
    IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#ifndef ONLINE_JUDGE
    clock_t start_time = clock();
#endif
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
#ifndef ONLINE_JUDGE
    cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
    return 0;
}