#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 1e6+10;
int T,n;
char s[MAXN];

int st[MAXN],match[MAXN],top;

void dfs(int x,int y){
	assert(x<y);
	cout<<'(';

	for(int p = x+1;p<y;p=match[p]+1){
		dfs(p,match[p]);
	}

	cout<<')';
}

void solve(){
	cin>>(s+1); n = strlen(s+1);
	rep(i,1,n)match[i] = 0;

	top = 0;
	per(i,n,1){
		if(s[i] == ')'){
			st[++top] = i;
		}else{
			if(!top){
				cout<<"impossible\n";
				return;
			}
			int j = st[top--];
			match[i] = j;
		}
	}

	for(int i=1;i<=n;)if(!match[i]){
		cout<<')';
		i++;
	}else{
		dfs(i,match[i]);
		i = match[i]+1;
	}
	cout<<'\n';
}

int main(){
	ios::sync_with_stdio(false);

	cin>>T;
	while(T--)solve();

    return 0;
}