def max_Prime_Factors(n):
    if n <= 1:
        return None

    largest_factor = None

    while n % 2 == 0:
        largest_factor = 2
        n //= 2

    factor = 3
    while factor * factor <= n:
        while n % factor == 0:
            largest_factor = factor
            n //= factor
        factor += 2

    if n > 1:
        largest_factor = n

    return largest_factor