A programmer at the South Pole was working on a computer wearing gloves, so he could only type and . However, the key got stuck. Is it possible for him to type the smallest number consisting of only ones that is also a multiple of a given number ?
One integer (n \le 1000) is given.
Print the required number, or no if no such number exists.
Example 1
Example 2