#include <bits/stdc++.h>
using namespace std;
const int N = 1205;
int f[N][N], res[N], dd[N], n, l[N], r[N];
int cnt = 0;
int calc(int i, int j) {
  if (i > n || j < l[i]) return 0;
  if (j == 1) return 1;
  if (f[i][j] != -1) return f[i][j];
  if (cnt > 100) exit(0);
  if (l[i] <= j && j <= r[i] && calc(i + 1, j - 2)) return f[i][j] = 1;
  for (int k = l[i]; k <= r[i] && k < j; k++)
    if (k % 2 && calc(i, k) && calc(i + (k + 1) / 2, j - k - 1))
      return f[i][j] = 1;
  return f[i][j] = 0;
}
void tv(int i, int j) {
  if (j == 1) {
    res[i] = 1;
    return;
  }
  if (l[i] <= j && j <= r[i] && calc(i + 1, j - 2)) {
    res[i] = j;
    tv(i + 1, j - 2);
    return;
  }
  for (int k = l[i]; k <= r[i]; k++)
    if (k % 2 && calc(i, k) && calc(i + (k + 1) / 2, j - k - 1)) {
      tv(i, k);
      tv(i + (k + 1) / 2, j - k - 1);
      return;
    }
}
int main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> l[i] >> r[i];
  memset(f, -1, sizeof f);
  if (!calc(1, 2 * n - 1)) {
    cout << "IMPOSSIBLE";
    return 0;
  }
  tv(1, 2 * n - 1);
  int j = 1;
  for (int i = 1; i <= n; i++) {
    while (dd[j]) j++;
    dd[j] = 1;
    dd[j + res[i]] = 2;
  }
  for (int i = 1; i <= 2 * n; i++)
    if (dd[i] == 1)
      cout << '(';
    else
      cout << ')';
}
