#include 
     
      #include 
      
       #include 
       
        using namespace std;const int N=2005;const int Max=100;int f[N],a[N],d[N][N];int n,total;string str[N];int diff(string str1,string str2){    int num=0;    for(int i=0;i
        
         >n)    {        if(n==0) break;        for(int i=1;i<=n;i++)        cin>>str[i];        for(int i=1;i<=n;i++)        {            for(int j=i+1;j<=n;j++)            {                d[i][j]=diff(str[i],str[j]);                d[j][i]=d[i][j];            }        }        for(int i=2;i<=n;i++)        {            f[i]=0;            a[i]=d[1][i];        }        path();        cout<<"The highest possible quality is 1/"<
         
          <<"."<