// g++-13 3.cpp -std=c++17 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

void solve(){
  string s;cin>>s;
  int n=s.size();
  string p="",q="";
  rep(i,0,n){
    if(s[i]=='('){
      p+='(';
      q+=')';
    }
    else{
      if(q.size()>0&&q[q.size()-1]==')'){
        q.pop_back();
        p+=')';
      }
      else{
        p+=')';
      }
    }
  }
  reverse(all(q));
  p+=q;

  if(s==p){
    cout<<s<<endl;
  }
  else{
    cout<<"impossible"<<endl;
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

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


}