#include <bits/stdc++.h>
using namespace std;
struct point {
int x;
int y;
int power;
};
int max(point p[], int n) {
int max = p[0].power;
int r = 0;
for (int i = 0; i < n; i++) {
if (p[i].power >= max) {
max = p[i].power;
r = i+1;
}
}
return r;
}
int main() {
int n;
cin >> n;
point p[n] = {0, 0, 0};
for (int i = 0; i < n; i++) {
cin >> p[i].x;
cin >> p[i].y;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (p[j].x < p[i].x && p[j].y < p[i].y) {
p[i].power++;
}
}
}
for (int i = 0; i < n; i++) {
cout << p[i].power << endl;
}
cout << max(p, n);
return 0;
}