#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
long long add(long long a, long long b) {
  long long ret = a + b;
  if (ret >= 1000000007) ret -= 1000000007;
  return ret;
}
long long subtract(long long a, long long b) {
  long long ret = a - b;
  if (ret < 0) ret += 1000000007;
  return ret;
}
long long mult(long long a, long long b) {
  long long ret = a * b;
  if (ret >= 1000000007) ret %= 1000000007;
  return ret;
}
long long bigmod(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = mult(ret, a);
    b >>= 1;
    a = mult(a, a);
  }
  return ret;
}
long long inverse(long long n) { return bigmod(n, 1000000007 - 2); }
bool base[1000010];
vector<int> primes;
void sieve(int mx) {
  mx += 10;
  int x = sqrt(mx);
  for (int i = 3; i <= x; i += 2)
    if (base[i] == 0)
      for (int j = i * i, k = i << 1; j < mx; j += k) base[j] = 1;
  primes.push_back(2);
  for (int i = 3; i < mx; i += 2)
    if (base[i] == 0) primes.push_back(i);
}
bool checkBit(int n, int i) { return (n & (1 << i)); }
int setBit(int n, int i) { return (n | (1 << i)); }
int resetBit(int n, int i) { return (n & (~(1 << i))); }
int n, dp[1210][1210], l[1210], r[1210];
char ans[1210];
int f(int len, int i) {
  if (len == 0) return 1;
  int &ret = dp[len][i];
  if (ret != -1) return ret;
  ret = 0;
  for (int j = l[i]; j < len && j <= r[i]; j += 2)
    ret |= f(j - 1, i + 1) & f(len - 1 - j, i + (j - 1) / 2 + 1);
  return ret;
}
void bt(int len, int i, int st, int en) {
  if (len == 0) return;
  for (int j = l[i]; j < len && j <= r[i]; j += 2) {
    if (f(j - 1, i + 1) && f(len - 1 - j, i + (j - 1) / 2 + 1)) {
      ans[st] = '(';
      ans[st + j] = ')';
      bt(j - 1, i + 1, st + 1, st + j - 1);
      bt(len - 1 - j, i + (j - 1) / 2 + 1, st + j + 1, en);
      return;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d%d", &l[i], &r[i]);
    l[i] += (!((l[i]) & 1));
  }
  memset(dp, -1, sizeof(dp));
  if (f(n * 2, 0) == 0) {
    puts("IMPOSSIBLE");
    return 0;
  }
  bt(n * 2, 0, 0, n * 2 - 1);
  for (int i = 0; i < n * 2; ++i) printf("%c", ans[i]);
  puts("");
  return 0;
}
