// clang-format off
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <bitset>
#include <vector>
#include <algorithm>
#include <random>
#include <map>
#include <string>
#include <set>
#include <deque>
#include <cassert>



const int N = 3e5 + 7, A = 26, C = 2, MOD = 998244353, bl = 350;
#define int long long
const long long INF = 2e9;
using namespace std;
using ll = long long;
using ld = long double;

const ld EPS = 1e-9;
int n, m;

struct Index {
    int ind;
};

int a[N];

bool operator < (Index a1, Index b1) {
    return a[a1.ind] > a[b1.ind];
}

set<Index> s;

char answ[N];
bool taken[N];

void solve() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        if (i % 2) {
            answ[i] = ')';
        }
        else {
            answ[i] = '(';
        }
        taken[i] = 0;
    }
    s.clear();
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int j = 0; j < 1; j++) {
        s.clear();
        for (int i = 0; i < n; i++) {
            if (answ[i] == '(') {
                if (s.empty() || a[(s.begin()->ind)] < a[i]) {
                    continue;
                }
                int ind = s.begin()->ind;
                answ[ind] = '(';
                answ[i] = ')';
                s.erase(s.begin());
                s.insert({ i });
            }
            else {
                s.insert({ i });
            }
        }
    }
    for (int i = 0; i < n; i++) {
        cout << answ[i];
    }
    cout << "\n";
}

signed main() {
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
#else
    std::ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}