#include <stdio.h>
#include <string.h>
#include <assert.h>

#include <vector>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

#define eb emplace_back

using namespace std;

typedef long long LL;
constexpr int N = 400005, M = 1000005;
constexpr int INF = 0x3f3f3f3f;

bool chk(char *s, int n) {
	for (int i = 1; i < n; ++i) {
		if (s[i] == s[i - 1]) {
			return false;
		}
	}
	for (int i = 0; i < n; ++i) {
		if (s[i] != s[2 * n - i - 1]) {
			return false;
		}
	}
	return true;
}

int n; char s[N];

bool chk() {
	int i;
	for (i = 1; i < 2 * n; ++i) {
		if (s[i] == s[i - 1]) {
			break;
		}
	}
	if (i == n) {
		return chk(s, i);
	}
	return chk(s, i) && chk(s + 2 * i, n - i) && s[2 * i - 1] != s[2 * i];
}

int main() {
	int task;
	for (scanf("%d", &task); task--; ) {
		scanf("%s", s), n = strlen(s);
		for (int i = 0; i < n; ++i) {
			s[i] = (s[i] == '(' || s[i] == ')');
		}
		n /= 2;
		puts(chk() ? "Yes" : "No");
	}
	return 0;
}