import math

def divisorGenerator(n):
    large_divisors = []
    for i in range(1, int(math.sqrt(n) + 1)):
        if n % i == 0:
            yield i
            if i*i != n:
                large_divisors.append(n / i)
    for divisor in reversed(large_divisors):
        yield divisor

def divisorTest(ls):
    i = 0
    while i < len(ls):
        ls[i] %= 10
        i += 1
    result = True
    for val in range(10):
        if val not in ls:
            result = False
    return result

def test():
    n = 2
    result = False
    while not result:
        result = divisorTest(list(divisorGenerator(n)))
        n += 1
    return n-1