





'''simple docstring'''


from maths.is_square_free import is_square_free
from maths.prime_factors import prime_factors
def       __snake_case		( SCREAMING_SNAKE_CASE_ :			int )							->     int:

       """simple docstring"""


       UpperCAmelCase  =						prime_factors(SCREAMING_SNAKE_CASE_ )
       if is_square_free(SCREAMING_SNAKE_CASE_ ):
              return -1 if len(SCREAMING_SNAKE_CASE_ ) % 2 else 1
       return 0


if __name__ == "__main__":
    import doctest

    doctest.testmod()






"""simple docstring"""




def       a_ (	lowercase__ :int = 10**9     ):
			__lowerCamelCase          =      1
			__lowerCamelCase          =      2

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

						prev_value += 2 * value
						value += prev_value

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

			return perimeters_sum


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




