#include <bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ull = unsigned long long;
using ld = long double;

template<class T>
bool chmin(T &a, T b) {
    if(a <= b) return false;
    a = b;
    return true;
}

template<class T>
bool chmax(T &a, T b) {
    if(a >= b) return false;
    a = b;
    return true;
}

using namespace std;

void solve(){
    string s; cin >> s;
    int n; n = s.size();
    int nw = 0;
    string ans = "";
    rep(i,0,n){
        if (s[i] == '('){
            nw++;
            ans += '(';
        }else{
            nw = max(nw-1, 0);
            ans += ')';
        }
    }
    if (nw > 0){
        cout << "impossible\n";
    }else{
        cout << ans << '\n';
    }
}

int main() {
    int t; cin >> t;
    while(t--) solve();
}