#include <bits/stdc++.h>
using namespace std;
const int MAXN = 605;
int dp[MAXN][MAXN];
int L[MAXN], R[MAXN];
int n;
int dfs(int l, int r) {
  if (dp[l][r]) return dp[l][r];
  int idx = (r - l) * 2 + 1;
  if (idx >= L[l] && idx <= R[l]) {
    if (l == r)
      return dp[l][r] = 1;
    else if (dfs(l + 1, r) != -1) {
      return dp[l][r] = 1;
    }
  }
  for (int i = l; i < r; i++) {
    int idx = (i - l) * 2 + 1;
    if (idx >= L[l] && idx <= R[l])
      if (dfs(l, i) != -1 && dfs(i + 1, r) != -1) return dp[l][r] = 1;
  }
  return dp[l][r] = -1;
}
void path(int l, int r) {
  int idx = (r - l) * 2 + 1;
  if (idx >= L[l] && idx <= R[l]) {
    if (l == r) {
      printf("()");
      return;
    } else if (dp[l + 1][r] == 1) {
      printf("(");
      path(l + 1, r);
      printf(")");
      return;
    }
  }
  for (int i = l; i < r; i++) {
    int idx = (i - l) * 2 + 1;
    if (idx >= L[l] && idx <= R[l]) {
      if (dp[l][i] == 1 && dp[i + 1][r] == 1) {
        path(l, i);
        path(i + 1, r);
        return;
      }
    }
  }
}
void solve() {
  memset(dp, 0, sizeof(dp));
  if (dfs(1, n) != -1) {
    path(1, n);
    puts("");
  } else
    puts("IMPOSSIBLE");
}
int main() {
  while (scanf("%d", &n) != EOF) {
    for (int i = 1; i <= n; i++) scanf("%d%d", &L[i], &R[i]);
    solve();
  }
  return 0;
}
