#include <stdio.h>

int round[5];
int best[8192][64];
int predk[8192][64], predm[8192][64];
int cat[13];
int nbits[8192];

int cmp(int *a, int *b){
   if (*a<*b) return -1;
   if (*a>*b) return +1;
   return 0;
}

main(){
   int i,j; register k,m,mask;
   for (k=0;k<8192;k++){
      mask = 0;
      for (m=0;m<13;m++){
         mask += (k & (1<<m)) != 0;
      }
      nbits[k] = mask;
   }
   for (;;){
      for (i=0;i<8192;i++) for (j=0;j<64;j++) best[i][j] = -99999;
      best[0][0] = 0;
      for (i=0;i<13;i++){
         if (5 != scanf("%d%d%d%d%d",round,round+1,round+2,round+3,round+4)) return 0;
         qsort(round,5,sizeof(int),cmp);
         for (j=0;j<13;j++){
            int score = 0, topscore = 0;
            switch (j) {
            case 0: /* ones */
            case 1: /* twos */
            case 2: /* threes */
            case 3: /* fours */
            case 4: /* fives */
            case 5: /* sixes */
                    for (k=0;k<5;k++) if (round[k] == j+1) score += j+1;
                    topscore = score;
                    break;
            case 6: /* chance*/
                    for (k=0;k<5;k++) score += round[k];
                    break;
            case 7: /* 3 kind*/
                    if (round[0] == round[2] || round[1] == round[3] ||
                                 round[2] == round[4])
                       for (k=0;k<5;k++) score += round[k];
                    break;
            case 8: /* 4 kind*/
                    if (round[0] == round[3] || 
                                 round[1] == round[4])
                       for (k=0;k<5;k++) score += round[k];
                    break;
            case 9: /* 5 kind*/
                    if (round[0] == round[4])
                       score = 50;
                    break;
            case 10: /* short */
                     if (round[1]==round[2]-1&&round[2]==round[3]-1
                         &&(round[0]==round[1]-1||round[3]==round[4]-1))
                       score = 25;
                    break;
            case 11: /* long */
                     if (round[1]==round[2]-1&&round[2]==round[3]-1
                         &&round[0]==round[1]-1&&round[3]==round[4]-1)
                       score = 35;
                    break;
            case 12: /* house */
                    if((round[0]==round[1]&&round[2]==round[4])
                        ||(round[0]==round[2]&&round[3]==round[4]))
                    score = 40;
                    break;
            }
            for (k=0;k<8192;k++){
               if (nbits[k] != i) continue;
               if (k & (mask=1<<j)) continue;  /* category already taken */
               for (m=0;m<64;m++){
                  register newscore = best[k][m] + score;
                  register newtop = m + topscore;
                  if (newtop > 63) newtop = 63;
                  if (newscore > best[k|mask][newtop]) {
                     best[k|mask][newtop] = newscore;
                     predk[k|mask][newtop] = k;
                     predm[k|mask][newtop] = m;
                  }
               }
            }
         }
      }
      {
         int bestk=8191,bestm=63,bonus=35;
         j = bonus + best[8191][63];
         for (i=0;i<63;i++) if (best[8191][i] > j) {
            j = best[8191][i];
            bestm = i;
            bonus = 0;
         }
         while (bestk) {
            int x = bestk ^ predk[bestk][bestm];
            for (i=0;x>>=1;i++){}
            cat[i] = best[bestk][bestm] - 
                   best[predk[bestk][bestm]][predm[bestk][bestm]];
            x = predk[bestk][bestm];
            bestm = predm[bestk][bestm];
            bestk = x;
         }
         for (i=0;i<13;i++) printf("%d ",cat[i]);
         printf("%d %d\n",bonus,j);
      }
   }
}