#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 1000100;

int n, stk[maxn], top, a[maxn];
char s[maxn];

void solve() {
	scanf("%s", s + 1);
	n = strlen(s + 1);
	top = 0;
	for (int i = 1; i <= n; ++i) {
		if (s[i] == '(' || s[i] == ')') {
			if (top && (s[stk[top]] == '(' || s[stk[top]] == ')')) {
				s[stk[top]] = '(';
				s[i] = ')';
				a[stk[top]] = i;
				a[i] = stk[top];
				--top;
			} else {
				stk[++top] = i;
			}
		} else {
			if (top && (s[stk[top]] == '[' || s[stk[top]] == ']')) {
				s[stk[top]] = '[';
				s[i] = ']';
				a[stk[top]] = i;
				a[i] = stk[top];
				--top;
			} else {
				stk[++top] = i;
			}
		}
	}
	if ((s[1] == '(' || s[1] == ')') == (s[n] == '(' || s[n] == ')') && a[1] != n) {
		puts("No");
		return;
	}
	if (a[1] != n && a[1] + 1 != a[n]) {
		puts("No");
		return;
	}
	if (a[1] == n) {
		int l = 1, r = n;
		while (l + 1 < r) {
			if (a[l + 1] != r - 1 || (s[l] == '(') == (s[l + 1] == '(')) {
				puts("No");
				return;
			}
			++l;
			--r;
		}
		puts("Yes");
	} else {
		int l = 1, r = a[1];
		while (l + 1 < r) {
			if (a[l + 1] != r - 1 || (s[l] == '(') == (s[l + 1] == '(')) {
				puts("No");
				return;
			}
			++l;
			--r;
		}
		l = a[1] + 1;
		r = n;
		while (l + 1 < r) {
			if (a[l + 1] != r - 1 || (s[l] == '(') == (s[l + 1] == '(')) {
				puts("No");
				return;
			}
			++l;
			--r;
		}
		puts("Yes");
	}
}

int main() {
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}