#include <stdlib.h>
#include <stdio.h>

#if 0
#define ep printf
#else
#define ep 0 ||
#endif

char n[16][100];
int s[16];

int find(int sr){
 char *a;
 int i;
 a=n[sr];
 for(i=0;i<sr;i++)
  if(!strcmp(a,n[i]))return i;
 return -1;
}

void inv(char *a,char *d){
 int i;
 char *b;
 int c[10];
 b=a;
 for(i=0;i<10;i++){
  c[i]=0;
 }
 while(*b){
  c[*b-'0']++;
  b++;
 }
 for(i=0;i<10;i++){
  if(c[i])
   d+=sprintf(d,"%d%d",c[i],i);
 } 
}

int main(void){
 int a,b,c,d;
 while(1){
  next:
  scanf("%s\n",n[0]);
  ep("read %s\n",n[0]);
  if(n[0][0]=='-')break;
  a=0;
  ep("a==%d\n",a);
  while(a<15){
   ep("a==%d\n",a);
   inv(n[a],n[a+1]);
   ep("inv %s\n",n[a+1]);
   b=find(a+1);
   ep("f %d\n",b);
   if(b==a){
    if(a==0)printf("%s is self-inventorying\n",n[0]);
    else printf("%s becomes self-inventorying after %d steps\n",n[0],a);
    goto next;
   }
   else{
    if(b>=0){
     printf("%s enters an inventory loop of length %d\n",n[0],a+1-b);
     goto next;
    }
   }
   a++;
  }
  printf("%s can not be classified after 15 iterations\n",n[0]);
 }
 return 0;
}