B1019

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int>v;
int f1(vector<int> v){
int m=0;
for(int i=0;i<v.size();i++)
m=m*10+v[i];
return m;
}
int f2(vector<int> &v){
int n=0;
for(int i=v.size()-1;i>=0;i--)
n=n*10+v[i];
return n;
}
void f3(int n){
int a,b,c,d;
v.clear();
a=n/1000%10;b=n/100%10;c=n/10%10;d=n%10;
v.push_back(a);v.push_back(b);v.push_back(c);v.push_back(d);
sort(v.begin(),v.end());
}
int main(){
int n;
int a,b,c,d;
cin>>n;
f3(n);
if(f2(v)!=f1(v)){
while(f2(v)-f1(v)!=6174){
printf("%04d ",f2(v));
printf("- ");
printf("%04d ",f1(v));
printf("= ");
printf("%04d\n",f2(v)-f1(v));
f3(f2(v)-f1(v));
}
printf("%04d ",f2(v));
printf("- ");
printf("%04d ",f1(v));
printf("= ");
printf("%04d",f2(v)-f1(v));
}else
{
printf("%04d ",f2(v));
printf("- ");
printf("%04d ",f1(v));
printf("= ");
printf("%04d",f2(v)-f1(v));
}
return 0;
}