@staticmethod
def find_divisors(n):
    divisors = []
    for i in range(1, (int((n ** 0.5)) + 1)):
        if (n % i):
            continue
        divisors.append(i)
        j = (n // i)
        if (j != i):
            divisors.append(j)
    return sorted(divisors)
@staticmethod
def find_divisors(n):
    divisors = []
    for i in range(1, (int((n ** 0.5)) + 1)):
        if (n % i):
            continue
        divisors.append(i)
        j = (n // i)
        if (j != i):
            divisors.append(j)
    return sorted(divisors)