#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
bool xcmp(int a,int b){
return a>b;
}
void to_array(int a,int b[]){ //数字转化数组
for(int i=3;i>=0;i--)
{
b[i]=a%10;
a/=10;
}
}
int to_num(int b[]){ //数组转化数字
int acw=0;
for(int i=0;i<4;i++)
{
acw=acw+b[i]*pow(10,3-i);
}
return acw;
}
int main(){
int i,n,b[4],min,max;
scanf("%d",&n); //5482
while(1){
to_array(n,b);//将输入的数字a转换为数组; 5482
sort(b,b+4,xcmp);//降序排列数组b a8542
max=to_num(b);
sort(b,b+4);//2458
min=to_num(b);
n = max-min;//6084
printf("%04d - %04d = %04d\n",max,min,n);
if(n==6174 || n==0) break;
}
return 0;
}