#include <iostream.h>

int used[64];
int grid[5][5];

void get(void) {
 int i,j;
 for (i=0;i<64;i++) used[i] =0;
 for (i=0;i<5;i++) for (j=0;j<5;j++) cin >> grid[i][j];
}

void check(int i,int j,int sofar) {
  if (i+j==8) {
    used[sofar]=1;
  } else {
    if (i<4) check(i+1,j,sofar+grid[i][j]);
    if (j<4) check(i,j+1,sofar+grid[i][j]);
  }
}

void print(void) {
  int i;int max=0; int count=0;
  for (i=0;i<=64;i++) if (used[i]==1) {
      if (((i==0)||(used[i-1]==0))&&(i!=64)&&(used[i+1]!=0)) cout << i << "-";
    } else if ((i!=0)&&(used[i-1]==1)) cout << i-1 << ",";
  for (i=0;i<=64;i++) if (used[i]==1) {count++;max=(count<max?max:count);}
     else count=0;
  cout << "Longest sequence: " << max << "\n";
}

void main(void) {
  get();
  check(0,0,0);
  print();
}