#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>

#include <iostream>
#include <sstream>
#include <string>

#include <vector>
#include <list>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <algorithm>
using namespace std;

#define FOR(i,a,b) for ( int i = (a); i < (b); i++)
#define FOR2(i,a,b) for (int i = (a); i > (b); i--)
/*
#define FOR(i,n) for (int i=0; i<(n); i++)
#define FORTO(i,a,b) for (int i=(a); i<=(b); i++)
#define FORD(i,n) for (int i = (n)-1; i>=0; i--)
*/

#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define SIZE(x) int(x.size())

typedef pair<int,int> PII;
typedef long long ll;

int sum(int n)
{
	int res = 0;
	while (n)
	{
		res += n%10;
		n /= 10;
	}
	return res;
}

int main()
{
	while (1)
	{
		int N;
		scanf("%d", &N);
		if (!N) break;
		
		int s1 = sum(N), s2;
		for (int i = 11; ; ++i)
		{
			s2 = sum(N*i);
			if (s1 == s2)
			{
				printf("%d\n", i);
				break;
			}
		}
	}
	
	return 0;
}