// G. Hagopian solving Kattis Easiest Problem

#include <iostream>
using namespace std;

int sumOfDigits(int N) {
	int sum{ 0 };
	while (N) {
		sum += N % 10;
		N /= 10;
	}
	return sum;
}

int main() {
	int N{ 1 }, p{ 0 };
	
	while (N > 0 && N <= 100000) {
		cin >> N;
		int target = sumOfDigits(N);
		int output{ 11 };
		while (sumOfDigits(output * N) != target)
			++output;
		cout << output;
	}
}