// IOI clock problem by Henrik Edstroem

#include "fstream.h"

// Main
void main(void)
{
 int a[9];
 ifstream("INPUT.TXT") >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> a[5] >> a[6] >> a[7] >> a[8];
 for (int i = 0; i < 9; i++)
  a[i] = 4 - a[i] & 3;
 
 int b[9];
 int nBestSum = 100;
 for (b[0] = 0; b[0] < 4; b[0]++)
  for (b[1] = 0; b[1] < 4; b[1]++)
   for (b[2] = 0; b[2] < 4; b[2]++)
    for (b[3] = 0; b[3] < 4; b[3]++)
     if (a[0] == (b[0] + b[1] + b[3] & 3))
      for (b[4] = 0; b[4] < 4; b[4]++)
       if (a[1] == (b[0] + b[1] + b[2] + b[4] & 3))
        for (b[5] = 0; b[5] < 4; b[5]++)
         if (a[2] == (b[1] + b[2] + b[5] & 3))
          for (b[6] = 0; b[6] < 4; b[6]++)
           if (a[3] == (b[0] + b[3] + b[4] + b[6] & 3))
            for (b[7] = 0; b[7] < 4; b[7]++)
             if (a[6] == (b[3] + b[6] + b[7] & 3))
              for (b[8] = 0; b[8] < 4; b[8]++)
               if (a[4] == (b[0] + b[2] + b[4] + b[6] + b[8] & 3) && 
                 a[5] == (b[2] + b[4] + b[5] + b[8] & 3) && 
                 a[7] == (b[4] + b[6] + b[7] + b[8] & 3) && 
                 a[8] == (b[5] + b[7] + b[8] & 3) && 
                 b[0] + b[1] + b[2] + b[3] + b[4] + b[5] + b[6] + b[7] + b[8] < nBestSum)
                {
                 nBestSum = b[0] + b[1] + b[2] + b[3] + b[4] + b[5] + b[6] + b[7] + b[8];
                 ofstream out("OUTPUT.TXT");
                 for (i = 0; i < 9; i++)
                  for (int j = 0; j < b[i]; j++)
                   out << i + 1 << " ";
                }
}
