






import math


def   _A       (    SCREAMING_SNAKE_CASE__  :     int	):

    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(SCREAMING_SNAKE_CASE__	) + 1	)					,  6	):
        if number % i == 0 or number % (i + 2) == 0:
            return False
    return True


def   _A       (    SCREAMING_SNAKE_CASE__  :     int = 2000000	):
    return sum(num for num in range(3					,  SCREAMING_SNAKE_CASE__					,  2	) if is_prime(SCREAMING_SNAKE_CASE__	)	) + 2 if n > 2 else 0


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













def   _A       (    SCREAMING_SNAKE_CASE__  :     int	):
    UpperCamelCase	:Optional[Any]     							=       9

    while num > 0:
        if num % 10 != digit:
            return False
        num //= 100
        digit -= 1

    return True


def   _A       (    ):
    UpperCamelCase	:List[str]     							=       138902663

    while not is_square_form(num * num	):
        if num % 10 == 3:
            num -= 6  # (3 - 6) % 10 = 7
        else:
            num -= 4  # (7 - 4) % 10 = 3

    return num * 10


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





