"""simple docstring"""






from maths.prime_factors import prime_factors


def      UpperCAmelCase__			(							lowerCAmelCase__	:int						)					->       int:
      '''simple docstring'''


      if not isinstance(lowerCAmelCase__   ,						lowerCAmelCase__						):
            lowercase								=      f'Input value of [number={number}] must be an integer'
            raise TypeError(lowerCAmelCase__						)
      if number < 1:
            raise ValueError("""Input must be a positive integer"""						)
      return -1 if len(prime_factors(lowerCAmelCase__						)						) % 2 else 1


if __name__ == "__main__":
       import doctest

       doctest.testmod()




"""simple docstring"""






def      UpperCAmelCase__			(							lowerCAmelCase__	:int = 1_0**9						)					->       int:
      '''simple docstring'''


      lowercase								=      1
      lowercase								=      2

      lowercase								=      0
      lowercase								=      0
      lowercase								=      0
      while perimeter <= max_perimeter:
            perimeters_sum += perimeter

            prev_value += 2 * value
            value += prev_value

            lowercase								=      2 * value + 2 if i % 2 == 0 else 2 * value - 2
            i += 1

      return perimeters_sum


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



