#include <bits/stdc++.h>
using namespace std;
int l[112345], r[112345];
stack<pair<int, int> > st;
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> l[i] >> r[i];
  }
  string s = " ";
  for (int i = 1; i <= 2 * n; i++) s += ' ';
  int c = 0;
  for (int i = 1; i <= 2 * n; i++) {
    if (s[i] != ' ') continue;
    if (st.empty()) {
      st.push(make_pair(++c, i));
      s[i] = '(';
      if (c > n) {
        cout << "IMPOSSIBLE" << endl;
        return 0;
      }
      continue;
    }
    int x = st.top().first;
    int y = st.top().second;
    if (i - y >= l[x] and i - y <= r[x]) {
      s[i] = ')';
      st.pop();
    } else {
      st.push(make_pair(++c, i));
      s[i] = '(';
      if (c > n) {
        cout << "IMPOSSIBLE" << endl;
        return 0;
      }
    }
  }
  cout << s << endl;
  return 0;
}
