SP3929 MDIGITS1 - Different Digits

[English](/problems/MDIGITS1/en/) [Vietnamese](/problems/MDIGITS1/vn/) Given a positive integer n, your task is to find a positive integer m, which is a multiple of n, and that m contains the least number of different digits when represented in decimal. For example, number 1334 contains three different digits 1, 3 and 4.

The input consists of no more than 50 test cases. Each test case has only one line, which contains a positive integer n (1

For each test case, you should output one line, which contains m. If there are several possible results, you should output the smallest one.