#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define x first
#define y second 
#define endl '\n'
const LL maxn = 4e05+7;
const LL N=1e05+10;
const LL mod=1e09+7;
typedef pair<int,int>pl;
priority_queue<LL , vector<LL>, greater<LL> >t;
priority_queue<LL> q;
LL gcd(LL a, LL b){
	return b > 0 ? gcd(b , a % b) : a;
}

LL lcm(LL a , LL b){
	return a / gcd(a , b) * b;
}
void solve() 
{
	string s;
	cin>>s;
	int len =  s.size();
	int cnt1 = 0;
	stack<char>st;
	for(int i = 0 ; i < len ; i ++){
		if(s[i] == '('){
			st.push('(');
		}
		else{
			if(!st.empty()){
				st.pop();
			}
		}
	}
	if(!st.empty()){
		cout<<"impossible\n";		
	}
	else{
		cout<<s<<endl;
	}
}            
int main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t=1;
	cin>>t;
    while(t--)
    {
    	solve();
    }
    return 0;
}