/*
 * @(#) msu95_b.c - Problem 'B' ("Currency exchange rates")
 * solution of the ACM Programming Contest at the MSU in 1995.
 * (c) 1998 Ivan Maidanski <ivmai@chat.ru> http://ivmai.chat.ru
 * Freeware program source. All rights reserved.
 **
 * Language: ANSI C
 * Tested with: Borland C++ v3.1
 * Last modified: 1998-04-04 18:50:00 GMT+04:00
 */

/* Input data file: b.dat */

#include <stdio.h> /* FILE, EOF, fopen(), fscanf(), printf() */

#define MAXN 20
#define MINWIN 1.05

int n;
float r[MAXN][MAXN],m[MAXN][MAXN],p[MAXN][MAXN];
int w[MAXN-1][MAXN][MAXN];

int main(void)
{
 int i,j,k,h;
 FILE *f=fopen("b.dat","rt");
 while (fscanf(f,"%*[^0-9]%d",&n)!=EOF && n<=MAXN)
 {
  for (i=0;i<n;i++)
   for (j=0;j<n;j++)
   {
    r[i][j]=1;
    if (i!=j)
     fscanf(f,"%*[^.0-9]%f",&r[i][j]);
    m[i][j]=r[i][j];
   }
  for (h=0;h<n-1;h++)
  {
   for (i=0;i<n;i++)
    for (j=0;j<n;j++)
     p[i][j]=m[i][j];
   for (i=0;i<n;i++)
    for (j=0;j<n;j++)
     for (k=0,w[h][i][j]=j;k<h;k++)
      if (m[i][j]<=p[i][k]*r[k][j])
       m[i][j]=p[i][w[h][i][j]=k]*r[k][j];
   for (k=0;k<n;k++)
    if (m[k][k]>MINWIN)
     break;
   if (k<n)
    break;
  }
  if (k<n)
  {
   printf("%1.4f: %d",m[k][k],k+1);
   for (i=0;i<k;i++)
    printf(" %d",w[h][i][i]+1);
   printf(" %d\n",k+1);
  }
   else printf("no sequence exists\n");
 }
 return 0;
}