def is_polydivisible(n):
    n1 = str(n)
    for i in range(len(n1)):
        r = int(n1[0:i + 1]) % (i + 1)
        if r != 0:
            return False
    return True

09c0b416ec42bc702936d0602bfc81fc8dbabc4d
<mask token>

def is_polydivisible(n):
    n1 = str(n)
    for i in range(len(n1)):
        r = int(n1[0:i + 1]) % (i + 1)
        if r != 0:
            return False
    return True
