#include <bits/stdc++.h>
using namespace std;
const int N = 605;
const long long MOD = 1000000007;
int n;
int dis[N];
int vis[N];
int type[N * 2];
int l[N], r[N];
bool judge_calc(int now) {
  int index = 1;
  if (l[now] == 1) {
    dis[now] = 1;
    return true;
  }
  for (int i = now + 1; i < n && index < l[now]; i++)
    if (!vis[i]) {
      index += dis[i] + 1;
      vis[i] = 1;
    }
  if (index < l[now] || index > r[now]) return false;
  dis[now] = index;
  return true;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &l[i], &r[i]);
    if (~l[i] & 1) l[i]++;
  }
  for (int i = n - 1; i >= 0; i--) {
    if (!judge_calc(i)) {
      puts("IMPOSSIBLE");
      return 0;
    }
  }
  int index = 0;
  for (int i = 0; i < n; i++) {
    while (type[index]) index++;
    type[index] = 1;
    type[index + dis[i]] = -1;
  }
  for (int i = 0; i < 2 * n; i++) {
    if (type[i] == 1)
      printf("(");
    else
      printf(")");
  }
  return 0;
}
