#include <bits/stdc++.h>
// #include <algorithm>
// #include <queue>
// #include <map>
// #include <iostream>
// #include <string>
// #include <set>
#define endl '\n'

using namespace std;

using LL = long long;
using PII = pair<int, int>;
using i128 = __int128_t;
using ULL = unsigned long long;

const int INF = 0x3f3f3f3f, MOD = 1e9 + 7, N = 1e6 + 5;
const LL LINF = 0x3f3f3f3f3f3f3f3f;

void solve()
{
    string s;
    cin >> s;
    
    int n = s.size(), cnt[2] = {0};
    for(int i = 0; i < n; i ++ )
    {
        int k;
        if(s[i] == '(') cnt[0] ++ ;
        else cnt[1] ++ ;
    }

    int now = 0;
    for(int i = n - 1; ~i; i -- )
    {
        if(s[i] == ')') now ++ ;
        else now -- ;
        if(now < 0)
        {
            cout << "impossible" << endl;
            return;
        }
    }

    if(cnt[0] > cnt[1])
    {
        cout << "impossible" << endl;
    }
    else 
    {
        int now = 0;
        for(int i = 0; i < n; i ++ )
        {
            if(now == cnt[1]) break;
            cout << s[i];
            if(s[i] == '(') now ++ ;
            else if(now) now -- ;
            if(s[i] == ')') cnt[1] -- ;
        }

        cout << endl;
    }
}   

int main()
{
    // freopen("galactic.in", "r", stdin);
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int T = 1; 
    cin >> T;

    while(T -- )
        solve();
    return 0;
}