#include<stdio.h>
#include<algorithm>
#include<cassert>

#define maxn 805

using namespace std;

FILE*f=fopen("overlap.in","r");
FILE*g=fopen("overlap.out","w");

int n;
int multime[maxn];

struct pct{
	int x,y;
	int ind;
	
	friend bool operator < ( const pct &a , const pct &b ){
		if ( a.x != b.x ){
			return a.x < b.x;
		}
		return a.y < b.y;
	}
}A[maxn],B[maxn];

inline void rotate () {
	
	for ( int i = 1 ; i <= n ; ++i ){
		int xprim = B[i].x,yprim = B[i].y;
		B[i].x = -yprim;
		B[i].y = xprim;
	}
}

inline int cb ( int x , int y ){
	int p = 1,m,u = n;
	pct P; P.x = x; P.y = y;
	
	while ( p <= u ){
		m = (p + u) >> 1;
		if ( A[m].x == x && A[m].y == y ){
			return m;
		}
		if ( A[m] < P ){
			p = m + 1;
		}
		else{
			u = m - 1;
		}
	}
	
	return 0;
}

inline bool check () {
	
	for ( int i = 1 ; i <= n ; ++i ){
		if ( B[1].ind == A[i].ind )	continue ;
		
		for ( int j = 1 ; j <= n ; ++j ){
			multime[j] = 0;
		}
		
		multime[ B[1].ind ] = 1; multime[ A[i].ind ] = 2;
		int addx = A[i].x-B[1].x,addy = A[i].y-B[1].y;
		
		for ( int j = 2 ; j <= n ; ++j ){
			if ( !multime[ B[j].ind ] ){
				
				int pos = cb(B[j].x+addx,B[j].y+addy);
				if ( pos && !multime[ A[pos].ind ] && A[pos].ind != j ){
					multime[ B[j].ind ] = 1;
					multime[ A[pos].ind ] = 2;
				}
			}
		}
		
		int ok = 1;
		for ( int i = 1 ; i <= n ; ++i ){
			if ( !multime[i] ){
				ok = 0;
				break ;
			}
		}
		
		if ( ok )	return 1;
	}
	
	return 0;
}

int main () {
	
	fscanf(f,"%d",&n);
	for ( int i = 1 ; i <= n ; ++i ){
		fscanf(f,"%d %d",&A[i].x,&A[i].y); A[i].ind = i;
		B[i] = A[i];
	}
	sort(A+1,A+n+1);
	
	for ( int rotiri = 0 ; rotiri < 4 ; ++rotiri ){
		
		if ( check() ){
			break ;
		}
		else{
			rotate();
		}
	}
	
	int unu = 0,doi = 0;
	for ( int i = 1 ; i <= n ; ++i ){
		if ( multime[i] == 1 )	++unu;
		if ( multime[i] == 2 )	++doi;
	}
	assert(unu == doi);
	
	for ( int i = 1 ; i <= n ; ++i ){
		fprintf(g,"%d\n",multime[i]);
	}
	
	fclose(f);
	fclose(g);
	
	return 0;
}