#include <bits/stdc++.h>

using namespace std;

ifstream fin("overlap.in");
ofstream fout("overlap.out");

const int NMAX = 808;
int N, x, y;
pair<int,int> p[NMAX], init[NMAX];
map<pair<int,int>,int> match;

int main() {
    fin >> N;
    for(int i = 1; i <= N; ++i) {
        fin >> x >> y;
        init[i] = p[i] = make_pair(x, y);
        match[init[i]] = i;
    }
    // rotatie trigonometrica la 90 de grade: (-y, x)
    // rotatie in sensul acelor de ceasornic la 90 de grade: (y, -x)
    for(int rep = 0; rep < 4; ++rep) {
        for(int i = 1; i <= N; ++i) {
            swap(p[i].first, p[i].second);
            p[i].second *= -1;
        }
        for(int i = 2; i <= N; ++i) {
            int diffx = init[i].first - p[1].first,
                diffy = init[i].second - p[1].second;
            vector<int> prv(N + 2), nxt(N + 2), sol(N + 2);
            for(int j = 1; j <= N; ++j)
                if(i != j && match[make_pair(p[j].first + diffx, p[j].second + diffy)]) {
                    int index = match[make_pair(p[j].first + diffx, p[j].second + diffy)];
                    nxt[j] = index;
                    prv[index] = j;
                }
            bool ok = true;
            for(int j = 1; j <= N && ok; ++j) {
                int curr = j;
                while(prv[curr] && prv[curr] != j)
                    curr = prv[curr];
                bool colour = false;
                while(!sol[curr] && curr) {
                    sol[curr] = colour + 1;
                    colour ^= 1;
                    curr = nxt[curr];
                }
                if(colour)
                    ok = false;
            }
            if(ok) {
                for(int j = 1; j <= N; ++j)
                    fout << sol[j] << '\n';
                return 0;
            }
        }
    }
}