#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define ar array<int, 2>
#define pii pair<int, int>
#define pb push_back
#define vt vector
#define For(i, n) for (int i = 0; i < n; i++)
#define Rev(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, n) for (int i = 1; i <= n; i++)
#define REV(i, n) for (int i = n; i >= 1; i--)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define msb(x) (int) (31 - __builtin_clz(x))
template <typename T>
using mxpq = priority_queue<T>;
template <typename T>
using mnpq = priority_queue<T, vt<T>, greater<T>>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int a, int b) { return uniform_int_distribution<int>(a, b)(rng); }
const int mod = 1e9 + 7;
const int INF = 1e18L + 5;
const int N = 2e5 + 5;
const long double eps = 1e-9;
#define pdd pair<long double, long double>
struct ray {
	long double X, Y;
	long double cross(ray other) {
		return X * other.Y - Y * other.X;
	}
};
void solve() {
	int n;
	cin >> n;
	const long double pi = acos(-1);
	vt<array<long double, 4>> a(n);
	for (auto &p : a) {
		cin >> p[0] >> p[1];
		int an, r;
		cin >> an >> r;
		int p2 = an - r, p3 = an + r;
		p2 = (p2 + 360) % 360;
		p3 = (p3 + 360) % 360;
		if (p2 > p3) {
			swap(p2, p3);
		}
		p[2] = p2 * pi / 180, p[3] = p3 * pi / 180;
	}
	vt<vt<int>> g(n);
	vt<int> indeg(n, 0);
	queue<int> q;
	for (int i = 0; i < n; i++) {
		auto& [x, y, l, r] = a[i];
		ray r1, r2;
		r1.X = cos(l), r1.Y = sin(l);
		r2.X = cos(r), r2.Y = sin(r);
		for (int j = 0; j < n; j++) {
			if (i == j) {
				continue;
			}
			ray r3;
			r3.X = a[j][0] - x, r3.Y = a[j][1] - y;
			long double v1 = r1.cross(r3), v2 = r2.cross(r3);
			if ((v1 + eps > 0 && v2 - eps < 0)) {
				g[i].pb(j);
				indeg[j]++;
			}
		}
	}
	for (int i = 0; i < n; i++) {
		if (indeg[i] == 0) {
			q.emplace(i);
		}
	}
	vt<int> print;
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		print.pb(u + 1);
		for (int v : g[u]) {
			indeg[v]--;
			if (indeg[v] == 0) {
				q.emplace(v);
			}
		}
	}
	if (sz(print) < n) {
		cout << -1 << '\n';
		return;
	}
	for (auto& it : print) {
		cout << it << ' ';
	}
}
signed main()
{
#ifdef LOCAL
	freopen("in", "r", stdin);
	freopen("out", "w", stdout);
#endif
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	FOR(tt, t) solve();
	return 0;
}