TLEZ

#include<iostream>
#include<math.h>
#include<algorithm> 
using namespace std;
int a[4];
bool sortBigger(int x,int y)
{
	return x>y;
}
bool sortSmaller(int x,int y)
{
	return x<y;
}
int fMinus(void)
{
	int b[4],s[4],x,y;
	for(int i=0;i<4;++i)
	{
		b[i]=a[i];
		s[i]=a[i];
	}
	sort(b,b+3,sortBigger);
	sort(s,s+3,sortSmaller);
	for(int i=0;i<4;++i)
	{
		x+=b[i]*pow(10,i);
		y+=s[i]*pow(10,i);
	}
	return x-y;
}
int main(void)
{
	int n,c=0,k,i;
	scanf("%d",&n);
	while(n!=495)
	{
		i=2;
		k=n;
		while(i>=0&&k!=0)
		{
			a[i]=k%10;
			k/=10;
			--i;
		}
		n=fMinus();
		++c;
	}
	printf("%d",c);
	return 0;
}