#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;
using namespace chrono;

static uint32_t randXor(){
  static uint32_t x=123456789;
  static uint32_t y=362436069;
  static uint32_t z=521288629;
  static uint32_t w=88675123;
  uint32_t t;
 
  t=x^(x<<11);
  x=y;y=z;z=w;
  return w=(w^(w>>19))^(t^(t>>8));
}

static double rand01(){
    return (randXor()+0.5)*(1.0/UINT_MAX);
}

int calc(vector<int>&A,vector<int>&B,vector<int>&C,vector<int>&P,vector<int>&Q,vector<int>&R,vector<int>&S){
  int num=0;
  rep(i,2048){
    bool b=false;
    if(S[A[i]]==P[i]) b=true;
    if(S[B[i]]==Q[i]) b=true;
    if(S[C[i]]==R[i]) b=true;
    if(b) num++;
    else break;
  }
  return num;
}

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  vector<int> S(256),used(256);
  vector<int> A(2048),B(2048),C(2048),P(2048),Q(2048),R(2048);
  vector<int> A0,A1,B0,B1,C0,C1;
  rep(i,2048){
    cin>>A[i]>>B[i]>>C[i]>>P[i]>>Q[i]>>R[i];
    if(A[i]==0) A0.push_back(i);
    else A1.push_back(i);
    if(B[i]==0) B0.push_back(i);
    else B1.push_back(i);
    if(C[i]==0) C0.push_back(i);
    else C1.push_back(i);
  }
  A0.push_back(2048),A1.push_back(2048),B0.push_back(2048);
  B1.push_back(2048),C0.push_back(2048),C1.push_back(2048);
  
  auto startClock=system_clock::now();
  int score=0;
  int bestscore=0;
  vector<int> bestS;
  
  const static double END_TIME=1.8;
 
  double time=0.0;
  do{
    vector<int> S(256),used(256);
    int score=0;
    rep(i,2048){
      score++;
      if(used[A[i]] && S[A[i]]==P[i]) continue;
      if(used[B[i]] && S[B[i]]==Q[i]) continue;
      if(used[C[i]] && S[C[i]]==R[i]) continue;       
      int a=-1,b=-1,c=-1;
      if(used[A[i]]==0 && P[i]==0) a=lower_bound(ALL(A1),i)-A1.begin();
      if(used[A[i]]==0 && P[i]==1) a=lower_bound(ALL(A0),i)-A0.begin();
      if(used[B[i]]==0 && Q[i]==0) b=lower_bound(ALL(B1),i)-B1.begin();
      if(used[B[i]]==0 && Q[i]==1) b=lower_bound(ALL(B0),i)-B0.begin();
      if(used[C[i]]==0 && R[i]==0) c=lower_bound(ALL(C1),i)-C1.begin();
      if(used[C[i]]==0 && R[i]==1) c=lower_bound(ALL(C0),i)-C0.begin();
      if(a==-1 && b==-1 && c==-1){
        score--;
        break;
      }
      if(a>=b && a>=c){
        S[A[i]]=P[i];
        used[A[i]]=1;
      }
      else if(b>=c && b>=c){
        S[B[i]]=Q[i];
        used[B[i]]=1;
      }
      else{
        S[C[i]]=R[i];
        used[C[i]]=1;
      }
    }
    if(score>bestscore){
      bestscore=score;
      bestS=S;
    }
    
    time=(duration_cast<microseconds>(system_clock::now()-startClock).count()*1e-6);
  }while(time<END_TIME);

  for(int i=255;i>=0;i--) cout<<bestS[i];
  cout<<endl;
  
  cout<<calc(A,B,C,P,Q,R,bestS)<<endl;

  return 0;
}