#include <stdio.h>

#include<math.h>

#include <memory.h>

#include<queue>

#include <iostream>

using namespace std;

string dfs(int i, int j, int total);

const int N = 220;

char map[N][N];

int findKey(int i, int j)

{

	int kk = -1;

	for (int k = j;; k++)

	{

		if (i != 0 && map[i - 1][k] == ' ')

			return -1;

		if (map[i][k] == '\0')

		{

			return -1;

		}

		if (map[i][k] == ' ')

			continue;

		kk = k;

		break;

	}

	return kk;

}

string dfsSub(int i, int j, int total)

{

	//有子树

	while (j != 0 && map[i + 1][j - 1] == '-')

		j--;

	//找到key的开始

	while (map[i + 2][j] == ' ')

		j++;

	return dfs(i + 2, j, total);

}

string dfs(int i, int j, int total)

{

	string str = "";

	if (i == total)

		return str;

	int next = -1;

	if ((next = findKey(i, j)) == -1)

	{

		return str;

	}

	j = next;

	str += map[i][next];

	str = str + "(";

	if (i + 1 != total && map[i + 1][j] == '|')

	{

		string s2 = dfsSub(i + 1, j, total);

		str += s2;

	}

	str = str + ")";

	//下一个key,注意上层的---

	str += dfs(i, j + 1, total);

	return str;

}

int main()

{

	//freopen("d:\\1.txt", "r", stdin);

	int n;

	cin >> n;

	getchar();

	while (n--)

	{

		memset(map, 0, sizeof(map));

		int total = 0;

		while (true)

		{

			gets(map[total]);

			if (map[total][0] == '#')

			{

				break;

			}

			total++;

		}

		string str = "(";

		str += dfs(0, 0, total);

		str += ")";

		cout << str << endl;

	}

	return 0;

}