/*
60 + 0 + 100 + 64 = 224.
*/

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
#define pb push_back
#define pii pair<int, int>
inline int read()
{
	int sum = 0, nega = 1;
	char ch = getchar();
	while (ch > '9'||ch < '0')
	{
	    if (ch == '-') nega = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
	return sum * nega;
}
const int N = 2e6 + 9;
int T, n, nw, cnt;
char s[N], t[N];

inline void solve()
{
	scanf("%s", s + 1); n = strlen(s + 1); cnt = 0; nw = 0;
	L(i, 1, n)
	{
		if(s[i] == '(') t[++cnt] = '(', nw++;
		else t[++cnt] = ')', nw = max(0ll, nw - 1);
	}
	if(nw) puts("impossible");
	else
	{
		L(i, 1, cnt) putchar(t[i]); puts("");
	} return ;
}
signed main()
{
	T = read();
	L(i, 1, T) solve();
	return 0;
}