def max_Prime_Factors(n):
    max_factor = 1
    d = 2
    while d * d <= n:
        while n % d == 0:
            max_factor = d
            n //= d
        d += 1
    if n > 1:
        max_factor = n
    return max_factor