# include <bits/stdc++.h>

using namespace std ;

int stk[1000005] , top ;
int n ;
char s[1000005] ;
int pre[100005] ;
void solve()
{
	scanf("%s" , s + 1) ;
	n = strlen( s + 1 ) ;
	top = 0 ;
	for ( int i = 1 ; i <= n ; i++ )
	{
		pre[i] = 0 ;
		if ( s[i] == '(' )
		{
			stk[++ top] = i ;
		}
		else
		{
			if ( top ) pre[i] = stk[top --] ; 
		}
	}
	if ( top ) 
	{
		puts("impossible") ;
		return ;
	}
	for ( int i = 1 ; i <= n ; i++ ) printf("%s" , s[i]) ;
	puts("") ;
}

int main()
{
	int t ;
	scanf("%d" , &t) ;
	while ( t -- ) solve() ;
	return 0 ;
}