#include <cstdio>
#include <algorithm>
#include <unordered_map>
using namespace std;
const int nmax=1004;
struct point
{
    int x;
    int y;
    int pos;
    bool operator <(const point &aux) const
    {
        if(x!=aux.x) return (x<aux.x);
        return y<aux.y;
    }
}v[nmax],v2[nmax];
int n;
int anst[nmax],p[nmax],p2[nmax],val[nmax],vis[nmax];
inline void citeste()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        v[i].pos=i;
        scanf("%d%d",&v[i].x,&v[i].y);
    }
    sort(v+1,v+n+1);
   // for(int i=1;i<=n;i++) printf("(%d %d) ",v[i].x,v[i].y);
   // printf("\n");
}
int binarys(int x1,int y1)
{
    int st=1,dr=n;
    while(st<=dr)
    {
        int mij=(st+dr)/2;
        if(v[mij].x<x1) st=mij+1;
        else if(v[mij].x>x1) dr=mij-1;
        else
        {
            if(v[mij].y==y1) return mij;
            else if(v[mij].y<y1) st=mij+1;
            else dr=mij-1;
        }
    }
    return -1;
}
point rotate_90(point a)
{
    point b;
    b.x=-a.y;
    b.y=a.x;
    return b;
}
int dfs(int nod,int vlt)
{
    vis[nod]=1;
    if(val[nod]==0)
    {
        val[nod]=vlt;
        if(p[nod]!=-1) return dfs(p[nod],3-vlt);
        else
        {
            if(vlt==1) return 0;
            return 1;
        }
    }
    else
    {
        if(val[nod]!=vlt) return 0;
        return 1;
    }
}
int try_for(int rot,int transx,int transy)
{
   // printf("!!! %d %d %d\n",rot,transx,transy);
    for(int i=1;i<=n;i++)
    {
        val[i]=0;
        vis[i]=0;
        v2[i]=v[i];
        for(int j=1;j<=rot;j++) v2[i]=rotate_90(v2[i]);
        v2[i].x+=transx;
        v2[i].y+=transy;
        p[i]=binarys(v2[i].x,v2[i].y);
     //   printf("%d %d %d\n",v2[i].x,v2[i].y,p[i]);
    }
    int as=0;
    for(int i=1;i<=n;i++)
    {
        if(p[i]==-1) continue;
        if(!vis[i])
        {
            if(dfs(i,1)==0)
            {
                as=1;
                break;
            }
        }
    }
    for(int i=1;i<=n;i++) if(!vis[i]) return 0;
    as=1-as;
    return as;
}
void print_solution()
{
    for(int i=1;i<=n;i++) anst[v[i].pos]=val[i];
    for(int i=1;i<=n;i++) printf("%d\n",anst[i]);
}
inline void do_for_rotation_and_translation()
{
    point temp=v[1];
    for(int j=0;j<=3;j++)
    {
        for(int i=1;i<=n;i++)
        {
            if(try_for(j,v[i].x-temp.x,v[i].y-temp.y))
            {
                print_solution();
                return;
            }
        }
        temp=rotate_90(temp);
    }
}
int main()
{
    freopen ("overlap.in","r",stdin);
    freopen ("overlap.out","w",stdout);
    citeste();
    do_for_rotation_and_translation();
}