#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int a[30001];
int main()
{
    long long n,a1=1,c1=1,k=0,s=0,b1=1;
    cin>>n; 
    long long n1=n,ma=0,mi=0;
    while(n1)
    {
        k++,a[k]=n1%10,n1/=10;
        if(a[k]==0)
        s++;    
    }
    sort(a+1,a+k+1);
    for(int i=k;i>=1;i--)ma+=pow(10,i-1)*a[i];
    
    for(int i=1+s;i<=k;i++)mi+=pow(10,k-i)*a[i];
    cout<<ma-mi<<endl;
    return 0;
}