uva1626

#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<stdio.h>
#include<string>
using namespace std;
const int maxn = 1000 + 10;
const int INF = 0x3f3f3f3f;
int a[maxn];
int n;
int d[maxn][maxn];
string s;

bool match(char t1, char t2) {
	if ((t1 == '('&&t2 == ')') || (t1 == '['&&t2 == ']')) {
		return true;
	}
	return false;
}

void dp() {
	for (int i = 0; i < n; i++) {
		d[i + 1][i] = 0;
		d[i][i] = 1;
	}
	for (int i = n - 2; i >= 0; i--) {
		for (int j = i + 1; j < n; j++) {
			d[i][j] = n;
			if (match(s[i], s[j]))d[i][j] = min(d[i][j], d[i + 1][j - 1]);
			for (int k = i; k < j; k++) {
				d[i][j] = min(d[i][j], d[i][k] + d[k + 1][j]);
			}
		}
	}
}
void print(int i, int j) {
	if (i > j)return;
	if (i == j) {
		if (s[i] == '(' || s[i] == ')')printf("()");
		else printf("[]");
		return;
	}
	int ans = d[i][j];
	if (match(s[i], s[j])&&ans==d[i+1][j-1]) {
		printf("%c", s[i]); print(i + 1, j - 1); printf("%c", s[j]);
		return;
	}
	for (int k = i; k < j; k++) {
		if (ans == d[i][k] + d[k + 1][j]) {
			print(i, k); print(k + 1, j);
			return;
		}
	}
}
int main()
{
	int kase;
	while (cin >> kase && kase) {
		getline(cin, s);
		getline(cin, s);
		for (int i = 0; i < kase; i++) {
			memset(d, -1, sizeof(d));
			getline(cin,s);
			n = s.length();
			dp();
			if (s[0]==' ')cout << s ;
			else
			print(0, n-1);
			cout << endl;
			if (i != kase - 1)cout << endl;
		}
	}
	return 0;
}