#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define debug(fmt,...) \
    fprintf(stderr, fmt,##__VA_ARGS__)
#define debugln(fmt,...) \
    fprintf(stderr,"[%d] " fmt,__LINE__,##__VA_ARGS__)
#define TIME (1e3*clock()/CLOCKS_PER_SEC)
bool memBeg;
template<typename T,typename TT> void chkmin(T &x,TT y) {if(x>y) x=y;}
template<typename T,typename TT> void chkmax(T &x,TT y) {if(x<y) x=y;}
constexpr int mod=20051131;
void inc(int &x,int y) {x+=y; x-=(x>=mod)*mod;}
void dec(int &x,int y) {x-=y; x+=(x<0)*mod;}
constexpr int add(int x,int y) {return (x+y>=mod)?x+y-mod:x+y;}
constexpr int sub(int x,int y) {return (x<y)?x-y+mod:x-y;}
constexpr int quick_pow(int x,ll times,int ret=1) {
    for(;times;times>>=1,x=1ll*x*x%mod) if(times&1) ret=1ll*ret*x%mod;
    return ret;
}
mt19937_64 eng(19260817);
constexpr int maxn=2005;
// constexpr int dx[]={0,0,1,-1};
// constexpr int dy[]={1,-1,0,0};
int n,lx[maxn],ly[maxn],rx[maxn],ry[maxn];
ull mat[maxn<<1][maxn<<1];
int bel[maxn<<1][maxn<<1];
unordered_map<ull,int> idx;
int fa[maxn*maxn*8];
int find(int x) {return fa[x]==x?x:fa[x]=find(fa[x]);}
bitset<maxn*maxn*8> chose;
char ret[maxn];
bool memEn;
void fl() {
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
}
int main() {
    debug("%.24lf\n",fabs(&memEn-&memBeg)/1024.0/1024.0);
    // fl();
#ifdef LOCAL
    freopen("debug","w",stderr);
#endif
    scanf("%d",&n);
    for(int i=1;i<=n;i++) {
        scanf("%d%d%d%d",&lx[i],&ly[i],&rx[i],&ry[i]);
        lx[i]++; ly[i]++;
        ull now=eng();
        mat[lx[i]][ly[i]]^=now;
        mat[lx[i]][ry[i]+1]^=now;
        mat[rx[i]+1][ly[i]]^=now;
        mat[rx[i]+1][ry[i]+1]^=now;
    }
    for(int i=1;i<=2*n+2;i++) {
        for(int j=1;j<=2*n+2;j++) mat[i][j]^=mat[i][j-1];
    }
    for(int i=1;i<=2*n+2;i++) {
        for(int j=1;j<=2*n+2;j++) mat[i][j]^=mat[i-1][j];
    }
    int blks=0;
    for(int i=2;i<=2*n+1;i++) {
        for(int j=2,run=0;j<=2*n+1;j++) {
            run^=(mat[i][j]!=mat[i][j-1]);
            if(run&&!idx.count(mat[i][j])) {
                idx[mat[i][j]]=++blks;
            }
        }
    }
    for(int i=2;i<=2*n+1;i++) {
        for(int j=2;j<=2*n+1;j++) {
            if(idx.count(mat[i][j])) {
                bel[i][j]=idx[mat[i][j]];
            }
        }
    }
    iota(fa+1,fa+2*blks+1,1);
    for(int i=2;i<=2*n;i++) {
        for(int j=2,run=0;j<=2*n+1;j++) {
            run^=(bel[i][j]!=bel[i][j-1]);
            if(run) {
                auto merge=[&](int u,int v) {
                    // debug("u = %d, v = %d\n",u,v);
                    fa[find(u)]=find(v+blks);
                    fa[find(v)]=find(u+blks);
                };
                if(j>2&&bel[i+1][j-1]&&bel[i][j]!=bel[i+1][j-1]) {
                    merge(bel[i][j],bel[i+1][j-1]);
                }
                if(j<=2*n&&bel[i+1][j+1]&&bel[i][j]!=bel[i+1][j+1]) {
                    merge(bel[i][j],bel[i+1][j+1]);
                }
            }
        }
    }
    for(int i=2;i<=2*n+1;i++) {
        for(int j=2;j<=2*n+1;j++) {
            debug("%d ",bel[i][j]);
        }
        debug("\n");
    }
    for(int i=1;i<=blks;i++) {
        if(find(i)==find(blks+i)) {
            puts("-1\n0"); return 0;
        }
    }
    for(int i=1;i<=n;i++) {
        debug("---------i = %d---------\n",i);
        auto work=[&](int xl,int yl,int xr,int yr,
                        vector<pii> &pt,vector<pii> &kpt) {
            pt.clear();
            if(xl==xr&&yl==yr) {
                pt.emplace_back(xl,yl);
            } else if(xl==xr) {
                for(int j=yl;j<=yr;j++) pt.emplace_back(xl,j);
            } else if(yl==yr) {
                for(int j=xl;j<=xr;j++) pt.emplace_back(j,yl);
            } else {
                for(int j=yl;j<yr;j++) pt.emplace_back(xl,j);
                for(int j=xl;j<xr;j++) pt.emplace_back(j,yr);
                for(int j=yr;j>yl;j--) pt.emplace_back(xr,j);
                for(int j=xr;j>xl;j--) pt.emplace_back(j,yl);
            }
            kpt.clear(); kpt.emplace_back(pt[0]);
            for(int j=1;j<(int)pt.size();j++) {
                if(bel[pt[j-1].first][pt[j-1].second]!=
                    bel[pt[j].first][pt[j].second]) {
                    kpt.emplace_back(pt[j]);
                }
            }
            int key=-1;
            for(int j=0;j<(int)kpt.size();j++) {
                int x,y; tie(x,y)=kpt[j];
                if(!bel[x][y]) continue;
                int t=find(bel[x][y]);
                if((t<=blks&&chose[t])||(t>blks&&chose[find(t-blks)])) {
                    key=j&1; break;
                } else if((t<=blks&&chose[find(t+blks)])||(t>blks&&chose[t])) {
                    key=(j&1)^1; break;
                }
            }
            return key;
        };
        static vector<pii> pt,kpt,opt,okpt;
        int key1=work(lx[i],ly[i],rx[i],ry[i],pt,kpt);
        int key2=work(lx[i]-1,ly[i]-1,rx[i]+1,ry[i]+1,opt,okpt);
        for(pii v:kpt) {
            debug("(%d, %d) ",v.first,v.second);
        }
        debug("\n");
        int key=key1!=-1?key1:key2!=-1?key2:0;
        if(key1!=-1&&key2!=-1) assert(key1==key2);
        auto assign=[&](const vector<pii> &arr) {
            for(int j=0;j<(int)arr.size();j++) {
                int x,y; tie(x,y)=arr[j];
                if(!bel[x][y]) continue;
                int t=find(bel[x][y]),p=(j&1)^key;
                if(p) chose[find(t>blks?t:t+blks)]=1;
                else chose[find(t<=blks?t:t-blks)]=1;
            }
        };
        ret[i]=key+'0';
        assign(kpt); assign(okpt);
    }
    printf("%s\n",ret+1);
    int occ=0;
    for(int i=1;i<=blks*2;i++) {
        if(find(i)==i) occ++;
    }
    assert(!(occ&1));
    int wys=1;
    for(int i=0;i<occ;i+=2) wys=add(wys,wys);
    printf("%d\n",wys);
    return 0;
}
/*
g++ template.cpp -o template -std=c++14 -Wall -Wextra -Wshadow -fsanitize=address,undefined
*/