#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 20051131;
using Mint = ModInt<MO>;


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}

constexpr int DX[4] = {+1, 0, -1, 0};
constexpr int DY[4] = {0, +1, 0, -1};

const pair<string, Mint> NO("-1", 0);

int N;
vector<int> X0, X1, Y0, Y1;


namespace brute {
int f[4010][4010];
int meet[4010][4010];
int wall[8010][8010];

bool vis[4010][4010];
int waf;
void dfs(int x, int y) {
  vis[x][y] = true;
  for (int dir = 0; dir < 4; ++dir) {
    const int xx = x + DX[dir];
    const int yy = y + DY[dir];
    if (f[x][y] == f[xx][yy]) {
      if (!vis[xx][yy]) {
        dfs(xx, yy);
      }
    } else {
      const int w = wall[x + x + 1 + DX[dir]][y + y + 1 + DY[dir]];
      assert(~w);
      if (~waf) {
        connect(waf, w);
        connect(waf ^ 1, w ^ 1);
      } else {
        waf = w;
      }
    }
  }
}

pair<string, Mint> run() {
cerr<<"[brute::run]"<<endl;
  memset(f, 0, sizeof(f));
  for (int i = 0; i < N; ++i) {
    ++f[X0[i]][Y0[i]];
    --f[X0[i]][Y1[i]];
    --f[X1[i]][Y0[i]];
    ++f[X1[i]][Y1[i]];
  }
  for (int x = 0; x <= 2 * N; ++x) for (int y = 0; y <= 2 * N; ++y) f[x + 1][y] += f[x][y];
  for (int x = 0; x <= 2 * N; ++x) for (int y = 0; y <= 2 * N; ++y) f[x][y + 1] += f[x][y];
// for(int x=0;x<=2*N;++x)pv(f[x],f[x]+(2*N+1));
  memset(meet, 0, sizeof(meet));
  memset(wall, ~0, sizeof(wall));
  for (int i = 0; i < N; ++i) {
    { const int y = Y0[i]; for (int x = X0[i]; x < X1[i]; ++x) ++meet[x][y]; }
    { const int x = X1[i]; for (int y = Y0[i]; y < Y1[i]; ++y) ++meet[x][y]; }
    { const int y = Y1[i]; for (int x = X1[i]; x > X0[i]; --x) ++meet[x][y]; }
    { const int x = X0[i]; for (int y = Y1[i]; y > Y0[i]; --y) ++meet[x][y]; }
  }
  for (int i = 0; i < N; ++i) {
    int s = 0;
    { const int y = Y0[i]; for (int x = X0[i]; x < X1[i]; ++x) { s += (meet[x][y] - 1); wall[x + x + 1][y + y] = i << 1 | (s & 1); } }
    { const int x = X1[i]; for (int y = Y0[i]; y < Y1[i]; ++y) { s += (meet[x][y] - 1); wall[x + x][y + y + 1] = i << 1 | (s & 1); } }
    { const int y = Y1[i]; for (int x = X1[i]; x > X0[i]; --x) { s += (meet[x][y] - 1); wall[x + x - 1][y + y] = i << 1 | (s & 1); } }
    { const int x = X0[i]; for (int y = Y1[i]; y > Y0[i]; --y) { s += (meet[x][y] - 1); wall[x + x][y + y - 1] = i << 1 | (s & 1); } }
// cerr<<"i = "<<i<<": s = "<<s<<endl;
    assert(!(s & 1));
  }
// for(int x=0;x<=4*N;++x)pv(wall[x],wall[x]+(4*N+1));
  uf.assign(N << 1, -1);
  memset(vis, 0, sizeof(vis));
  for (int x = 1; x < 2 * N; ++x) for (int y = 1; y < 2 * N; ++y) if (f[x][y] & 1) {
    if (!vis[x][y]) {
      waf = -1;
      dfs(x, y);
    }
  }
  for (int i = 0; i < N; ++i) {
    if (root(i << 1) == root(i << 1 | 1)) {
      return NO;
    }
  }
  vector<int> cols(N << 1, -1);
  pair<string, Mint> ans(string(N, '?'), 1);
  for (int i = 0; i < N; ++i) {
    const int r = root(i << 1);
    if (!~cols[r]) {
      cols[r] = 0;
      cols[root(i << 1 | 1)] = 1;
      ans.second *= 2;
    }
    ans.first[i] = '0' + cols[r];
  }
  return ans;
}
}  // brute


int main() {
  for (; ~scanf("%d", &N); ) {
    X0.resize(N);
    X1.resize(N);
    Y0.resize(N);
    Y1.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d%d%d%d", &X0[i], &Y0[i], &X1[i], &Y1[i]);
    }
    
    pair<string, Mint> ans;
    if (N <= 2000) {
      ans = brute::run();
    } else {
      ans = make_pair(string(N, '0'), Mint(2).pow(N));
    }
    printf("%s\n", ans.first.c_str());
    printf("%u\n", ans.second.x);
  }
  return 0;
}