#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	int n;
	cin >> n;
	vector<pair<int, pair<int,int>>> sortedVec(n);
	for (int i = 0; i < n; i++)
	{
		int minC = 0;
		int totalProfit = 0;
		string s;
		cin >> s;
		for (size_t j = 0; j < s.size(); j++)
		{
			if (s[j] == '(') {
				totalProfit++;
			}
			else {
				totalProfit--;
				minC = min(minC, totalProfit);
			}
		}
		sortedVec[i] = { minC, {totalProfit, i } };
	}
	std::sort(sortedVec.begin(), sortedVec.end());
	std::reverse(sortedVec.begin(), sortedVec.end());
	int profit = 0;
	vector<int> res;
	for (size_t i = 0; i < n; i++)
	{
		if (profit >= sortedVec[i].first) {
			profit += sortedVec[i].second.first;
			res.push_back(sortedVec[i].second.second);
		}
		else {
			cout << "-1";
			break;
		}
	}
	for (size_t i = 0; i < res.size(); i++)
	{
		cout << res[i]+1 << " ";
	}
}