#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cassert>
#define BS 14
#define CF 14*14
using namespace std;

char mt[BS][BS],viz[26][BS][BS];
const char dx[] = {0,1,0,-1};
const char dy[] = {1,0,-1,0};
int steps;

void pm(char v[BS][BS]) {
  for(int i=0; i<BS; ++i) {
    for(int j=0; j<BS; ++j) cout<<int(v[i][j]);
    cout<<'\n';
  }
  cout<<'\n';
}


int ins(int a,int b) {
  return a>=0 && b>=0 && a<BS && b<BS;
}

int has_vis_ngb(int x, int y,char viz[BS][BS]) {
  for(int d=0; d<4; ++d) {
    int ii=x+dx[d],jj=y+dy[d];
    if(ins(ii,jj) && viz[ii][jj]) return 1;
  }
  return 0;
}

void fill(int a,int b,char c,char viz[BS][BS]) {
  viz[a][b]=1;
  for(int d=0; d<4; ++d) {
    int ii=a+dx[d],jj=b+dy[d];
    if(ins(ii,jj) && !viz[ii][jj] && mt[ii][jj]==c) fill(ii,jj,c,viz);
  }
}

void viz_col(char c,char viz[BS][BS]) {
  for(int i=0; i<BS; ++i) for(int j=0; j<BS; ++j) if(mt[i][j]==c && has_vis_ngb(i,j,viz))
    fill(i,j,c,viz);
}

int done(char viz[BS][BS]) {
  for(int i=0; i<BS; ++i) for(int j=0; j<BS; ++j) if(!viz[i][j]) return 0;
  return 1;
}

char vc[BS][BS];
class Conn_comp_counter {
public:
  static void fls(int a,int b,int c) {
    vc[a][b]=1;
    for(int d=0; d<4; ++d) {
      int ii=a+dx[d],jj=b+dy[d];
      if(ins(ii,jj) && !vc[ii][jj] && mt[ii][jj]==c) fls(ii,jj,c);
    }
  }

  static int start() {
    int r=0;
    for(int i=0; i<BS; ++i) for(int j=0; j<BS; ++j) if(!vc[i][j]) {
      ++r;
      fls(i,j,mt[i][j]);
    }
    return r;
  }

  static int init_start(char viz[BS][BS]) {
    memcpy(vc,viz,sizeof(vc));
    return start();
  }
};

int d_area(char a[BS][BS],char b[BS][BS]) {
  int r=0;
  for(int i=0; i<BS; ++i) for(int j=0; j<BS; ++j)
    r+=(a[i][j]^b[i][j]);
  return r;
}

int area(char a[BS][BS]) {
  int r=0;
  for(int i=0; i<BS; ++i) for(int j=0; j<BS; ++j)
    r+=a[i][j];
  return r;
}

int marg(char a[BS][BS]) {
  int r=0;
  for(int i=0; i<BS; ++i) r+=a[i][0]+a[i][13]+a[0][i]+a[13][i];
  return r;
}

int marg_dif(char a[BS][BS]) {
  int m1=0,m2=0,m3=0,m4=0;
  for(int i=0; i<BS; ++i) {
    m1|=a[i][0];
    m2|=a[i][13];
    m3|=a[0][i];
    m4|=a[13][i];
  }
  return m1+m2+m3+m4;
}

int chose_color_rec(int niv,int &cc,int fc,char viz[BS][BS]) {
  if(done(viz)) return 0;
  if(!niv)
    return Conn_comp_counter::init_start(viz)*CF*CF+marg(viz)*CF+marg_dif(viz);
  int bst=(1<<30);
  vector<int> pos;
  for(int c=0; c<6; ++c) if(c!=fc){
    char cpv[BS][BS]; memcpy(cpv,viz,sizeof(cpv));
    viz_col(c,viz);
    if(d_area(viz,cpv)) {
      int aux;
      int nrc=chose_color_rec(niv-1,aux,-1,viz);
      if(nrc<bst) {
        bst=nrc;
        pos.clear();
        pos.push_back(c);
      }else if(nrc==bst) {
        pos.push_back(c);
      }
    }
    memcpy(viz,cpv,sizeof(cpv));
  }
  assert(pos.size());
  cc=pos[rand()%pos.size()];
  assert(bst!=(1<<30));
  return bst;
  
}

int choose_and_visit(char viz[BS][BS],int fb,int steps) {
  int c;
  chose_color_rec(min(5,25-steps),c,fb,viz);
  viz_col(c,viz);
  //cout<<c<<' ';
  return c;
}

vector<int> cls;
void mutate(int fp) {
  //cout<<"Mutate "<<fp<<'\n';
  memset(viz[fp],0,sizeof(viz[fp]));
  memcpy(viz[fp],viz[fp-1],sizeof(viz[fp]));
  int fb = -1;
  if(fp<=cls.size()) fb=cls[fp-1];
  while(cls.size()>=fp) cls.pop_back();

  cls.push_back(choose_and_visit(viz[fp],fb,fp-1));
  //pm(viz[fp]);

  for(int i=fp+1; i<=25 && !done(viz[i-1]); ++i) {
    memset(viz[i],0,sizeof(viz[i]));
    memcpy(viz[i],viz[i-1],sizeof(viz[i]));
    int c=choose_and_visit(viz[i],-1,i-1);
    //pm(viz[i]);
    cls.push_back(c);
  }
  //for(int i=0; i<cls.size(); ++i) cout<<cls[i]<<' ';
  //cout<<'\n';
}

int main() {
  srand(time(NULL));
  //freopen("1000.in","r",stdin);
  for(int i=0; i<BS; ++i) {
    cin>>mt[i];
    for(int j=0; j<BS; ++j) mt[i][j]-='0';
  }
  viz[0][0][0]=1;
  viz_col(mt[0][0],viz[0]);
  mutate(1);
  while(!done(viz[cls.size()])) {
    int r=cls.size(); cerr<<r<<' ';
    mutate(rand()%r+1);
  }
  //pm(viz[cls.size()]);*/
  for(int i=0; i<cls.size(); ++i) cout<<cls[i]<<' ';
  cout<<'\n';
  
}