/*
 * author:  ADMathNoob
 * created: 08/15/24 23:11:42
 * problem: https://qoj.ac/problem/5108
 */

/*
Comments about problem:


*/

#include <bits/stdc++.h>

using namespace std;

#ifdef _DEBUG
#include "debug.h"
#else
#define debug(...) 42
#endif

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> down(n), up(n);
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    int mn = 0;
    int sum = 0;
    for (char c : s) {
      int d = (c == '(' ? +1 : -1);
      sum += d;
      mn = min(mn, sum);
    }
    down[i] = -mn;
    up[i] = sum + down[i];
  }
  vector<int> order(n);
  iota(order.begin(), order.end(), 0);
  sort(order.begin(), order.end(), [&](int i, int j) {
    return min(-down[i], -down[i] + up[i] - down[j]) > min(-down[j], -down[j] + up[j] - down[i]);
    // return max(down[i], down[i] - up[i] + down[j]) < max(down[j], down[j] - up[j] + down[i]);
    bool goodI = (up[i] >= down[i]);
    bool goodJ = (up[j] >= down[j]);
    if (goodI != goodJ) return goodI;
    if (goodI) return down[i] < down[j];
    return up[i] > up[j];
  });
  int at = 0;
  for (int i : order) {
    at -= down[i];
    if (at < 0) {
      cout << "impossible\n";
      return 0;
    }
    at += up[i];
  }
  if (at != 0) {
    cout << "impossible\n";
    return 0;
  }
  for (int i : order) {
    cout << i + 1 << '\n';
  }
  return 0;
}