factors = []


def isPrimeFactor(n):
    i = 2
    while i <= n:
        if n % i == 0:
            n = n / i
            factors.append(i)
        else:
            i = i + 1


isPrimeFactor(600851475143)
print(int(max(factors)))

3fa685c1e1e132da20cbca189c2dda02bec2e149
<mask token>

<mask token>


def isPrimeFactor(n):
    i = 2
    while i <= n:
        if n % i == 0:
            n = n / i
            factors.append(i)
        else:
            i = i + 1


<mask token>

<mask token>


def isPrimeFactor(n):
    i = 2
    while i <= n:
        if n % i == 0:
            n = n / i
            factors.append(i)
        else:
            i = i + 1


isPrimeFactor(600851475143)
print(int(max(factors)))

factors = []


def isPrimeFactor(n):
    i = 2
    while i <= n:
        if n % i == 0:
            n = n / i
            factors.append(i)
        else:
            i = i + 1


isPrimeFactor(600851475143)
print(int(max(factors)))
