





import math


def      SCREAMING_SNAKE_CASE      (   lowerCAmelCase       ):

       if 1 < number < 4:
              # 2 and 3 are primes
              return True
       elif number < 2 or number % 2 == 0 or number % 3 == 0:
              # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
              return False

       # All primes number are in format of 6k +/- 1
       for i in range(5     ,							int(math.sqrt(_UpperCAmelCase       ) + 1       )     ,							6       ):
              if number % i == 0 or number % (i + 2) == 0:
                     return False
       return True


def      SCREAMING_SNAKE_CASE      (   lowerCAmelCase = 600_851_475_143       ):

       try:
              _UpperCamelCase														=    int(_UpperCAmelCase       )
       except (TypeError, ValueError):
              raise TypeError('''Parameter n must be int or castable to int.'''       )
       if n <= 0:
              raise ValueError('''Parameter n must be greater than or equal to one.'''       )
       _UpperCamelCase														=    0
       if is_prime(_UpperCAmelCase       ):
              return n
       while n % 2 == 0:
              n //= 2
       if is_prime(_UpperCAmelCase       ):
              return n
       for i in range(3     ,							int(math.sqrt(_UpperCAmelCase       )       ) + 1     ,							2       ):
              if n % i == 0:
                     if is_prime(n // i       ):
                            _UpperCamelCase														=    n // i
                            break
                     elif is_prime(_UpperCAmelCase       ):
                            _UpperCamelCase														=    i
       return max_number


if __name__ == "__main__":
       print(F'''{solution() = }''')











def 	__snake_case      (     _UpperCAmelCase  ,					_UpperCAmelCase  ,					_UpperCAmelCase							):
    __a					=							[1 / first_term]
    __a					=							1 / first_term
    for _ in range(number_of_terms - 1							):
        first_term += common_difference
        arithmetic_progression.append(_UpperCAmelCase							)
    __a					=							[1 / step for step in arithmetic_progression]
    return sum(_UpperCAmelCase							)


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 print(sum_of_harmonic_progression(1 / 2, 2, 2))





