#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
#define lowbit(x) (x&(-x))
using namespace std;
typedef long long ll;

const int maxn = 1e6 + 10;

int main()
{
   int n;
   scanf("%d",&n);
   getchar();
   while(n--)
   {
       string a;

       getline(cin,a);
       int flag = 0;
       for(int i=0;i<a.size();i++)
       {
           if(flag == 0 && a[i] == 't' && a[i - 1] =='n' && a[i - 2] == 'i' && a[i - 3] == 'r' && a[i - 4] == 'p' && a[i+1] == ' ')
           {
               flag = 1;
               printf("%c",a[i]);
               printf("(");
           }
           else if(flag == 1 && a[i] == ' ')
           {
               flag = 2;
               continue;
           }
           else
               printf("%c",a[i]);

       }
       if(flag > 0)
         puts(")");
       else
           printf("\n");
   }
}