#include <stdio.h>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

int main(void)
{
	int numberOfTestcase;
	int i, j;
	int exponentCount, kaprekarCount;
	int low, high;
	int inputNumber;
	int arrayOfInputNumber[4];

	scanf("%d", &numberOfTestcase);
	
	for(i = 0; i < numberOfTestcase; i++)
	{
		scanf("%d", &inputNumber);
		kaprekarCount = 0;
		while(inputNumber != 6174)
		{
			for(j = 0; j < 4; j++)
			{
				arrayOfInputNumber[j] = inputNumber / pow(10, 3-j);
				inputNumber = inputNumber % (int)pow(10, 3-j);
			}
			vector<int> inputNumberLow(&arrayOfInputNumber[0], &arrayOfInputNumber[4]);
			sort(inputNumberLow.begin(), inputNumberLow.end());
			vector<int> inputNumberHigh(inputNumberLow.size());
			copy(inputNumberLow.begin(), inputNumberLow.end(), inputNumberHigh.begin());
			reverse(inputNumberHigh.begin(), inputNumberHigh.end());
			vector<int>::iterator it;
			
			low = 0;
			high = 0;
			exponentCount = 0;
			for(it = inputNumberLow.begin(); it != inputNumberLow.end(); it++)
			{
				low += *it * pow(10, 3-exponentCount);
				exponentCount++;
			}
			exponentCount = 0;
			for(it = inputNumberHigh.begin(); it != inputNumberHigh.end(); it++)
			{
				high += *it * pow(10, 3-exponentCount);
				exponentCount++;
			}
			inputNumber = high - low;
			kaprekarCount++;
		}
		printf("%d\n", kaprekarCount);
	}

	return 0;
}