#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(const char *s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(const char *s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  for (int f = 0; L != R; L++)
    cerr << (f++ ? ", " : "") << *L;
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

void solve() {
  string s;
  cin >> s;
  vector<char> S, T;
  for (char c : s) {
    if (c == '(') {
      S.push_back('(');
      T.push_back(')');
    } else if (c == ')') {
      if (T.empty()) {
        S.push_back(')');
      } else {
        assert (T.back() == ')');
        S.push_back(')');
        T.pop_back();
      }
    } else
      __builtin_unreachable();
  }
  string fin;
  reverse(all(T));
  for (char c : S) fin += c;
  for (char c : T) fin += c;
  if (fin == s)
    cout << s << '\n';
  else
    cout << "impossible\n";
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--)
    solve();

  return 0;
}