def max_Prime_Factors(n):
    largest = 1
    # Divide out factor of 2
    while n % 2 == 0:
        largest = 2
        n //= 2
    # Check odd factors from 3 upward
    factor = 3
    while factor * factor <= n:
        while n % factor == 0:
            largest = factor
            n //= factor
        factor += 2
    # If n is still greater than 1, it's a prime factor
    if n > 1:
        largest = n
    return largest