Different Digits

Given a positive integer $n$, find a positive integer $m$ that is a multiple of $n$ and, when written in decimal, contains the fewest distinct digits. If several such $m$ share this minimum number of distinct digits, output the smallest one.

For example, $1334$ contains three distinct digits: $1$, $3$, and $4$.

The input contains at most $50$ test cases. Each test case is a single line holding one positive integer $n$ ($1 \le n < 65536$). There are no blank lines between test cases. A line containing a single $0$ terminates the input and is not processed.

For each test case, print $m$ on its own line. If more than one $m$ qualifies, print the smallest. Do not print blank lines between test cases.