// Problem: G. Hard Brackets Problem
// Contest: Codeforces - 2023 China Collegiate Programming Contest (CCPC) Guilin Onsite (The 2nd Universal Cup. Stage 8: Guilin)
// URL: https://codeforces.com/gym/104768/problem/G
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// Begin:2024-10-20 17:06:45
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 5, M = 1e9 + 7, mod = 998244353;
#define YES {cout << "Yes" << endl; return ;}
#define NO {cout << "No" << endl; return ;}
char st[N];
char ans[N];
int top, now;
void solve(){
	top = 0;
	now = 0;
    string s; cin >> s;
    int n = s.size();
    for (int i = 0; i < n; i++){
    	char c = s[i];
    	if (c == '(') {
    		st[++top] = c;
    		ans[++now] = '(';
    	}
    	else {
    		if (top == 0) {
    			ans[++now] = ')';
    		}else if (top != n - i){
    			ans[++now] = ')';
    			top--;
    		}else{
    			top--;
    		}
    	}
    }
    if (top) cout << "impossible\n";
    else {
    	for (int i = 1; i <= now; i++){
    		cout << ans[i];
    	}
    	cout << "\n";
    }
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int ___ = 1;
    cin >> ___;
    while (___--)
        solve();
    return 0;
}