#include <iostream>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;

int main() {
  int n;
  cin >> n;

  vector<string> tablets(n);
  vector<pair<int, int>> balance(n);

  for(int i = 0; i < n; i++)
  {
    cin >> tablets[i];
    int balance_cnt = 0;
    for (char c : tablets[i])
      if(c == '(')
        balance_cnt++;
      else
        balance_cnt--;

    balance[i] = {balance_cnt, i + 1};
  }

  sort(balance.begin(), balance.end());
  

  // check the balance first
  int balance_sum = 0;
  for(int i = 0; i < n; i++)
    balance_sum += balance[i].first;
  
  if(balance_sum != 0)
  {
    cout << "impossible";
    return 0;
  }

  for(int i = n - 1; i >= 0; i--)
  {
    cout << balance[i].second << endl;
  }
}