#include<stdio.h>
int max(int n)
{
	int b[10],i=0,j,k,z=0,t;
	while(n)
	{
		b[i]=n%10;
		n=n/10;
		z++;i++;
	}
	for(j=0;j<z;j++)
	{
		for(k=0;k<z-j;k++)
		{
			if(b[k]<b[k+1])
			{t=b[k];b[k]=b[k+1];b[k+1]=t;}
		}
	}
	for(j=0;j<z;j++)
		n=n*10+b[j];
	
	return n;
}

int min(int n)
{
	int b[10],i=0,j,k,z=0,t;
	while(n)
	{
		b[i]=n%10;
		n=n/10;
		z++;i++;
	}
	for(j=0;j<z;j++)
	{
		for(k=0;k<z-j-1;k++)
		{
			if(b[k]>b[k+1])
			{t=b[k];b[k]=b[k+1];b[k+1]=t;}
		}
	}
	for(j=0;j<z;j++)
		n=n*10+b[j];
	
	return n;
}

int main()
{
	int a[100],i=0,c,z;

	while(1)
	{
		z=0;
		scanf("%d",&a[i]);
		if(a[i]==-1)break;
		printf("N=%d:\n",a[i]);
		if(max(a[i])-min(a[i])==0)
		{printf("No!!\n");continue;}
		if(a[i]<1000||a[i]>9999)
		{printf("No!!\n");continue;}
		while(1)
		{
			c=max(a[i])-min(a[i]);
			 printf("%d-%d=%d\n",max(a[i]),min(a[i]),c);
			z++;
			if(c==0||c==6174)
			{
				printf("Ok!! %d times\n",z);break;
			}
			a[i]=c;
		}
		i++;
	}
	return 0;
}