





'''simple docstring'''


def 	__a(SCREAMING_SNAKE_CASE_  :					int		,       SCREAMING_SNAKE_CASE_  :					int    ):



    '''simple docstring'''





    while second != 0:
        _lowerCAmelCase				=      first & second
        first ^= second
        _lowerCAmelCase				=      c << 1
    return first


if __name__ == "__main__":
       import doctest

       doctest.testmod()

       _SCREAMING_SNAKE_CASE	 =					int(input("Enter the first number: ").strip())
       _SCREAMING_SNAKE_CASE	 =					int(input("Enter the second number: ").strip())
       print(f'''{add(first, second) = }''')









'''simple docstring'''


from math import isqrt, loga


def 	__a(SCREAMING_SNAKE_CASE_  :					int    ):



    '''simple docstring'''





    _lowerCAmelCase				=      [True] * max_number
    for i in range(2		,       isqrt(max_number - 1    ) + 1    ):
        if is_prime[i]:
            for j in range(i**2		,       SCREAMING_SNAKE_CASE_		,       SCREAMING_SNAKE_CASE_    ):
                _lowerCAmelCase				=      False

    return [i for i in range(2		,       SCREAMING_SNAKE_CASE_    ) if is_prime[i]]


def 	__a(SCREAMING_SNAKE_CASE_  :					int = 800800		,       SCREAMING_SNAKE_CASE_  :					int = 800800    ):



    '''simple docstring'''





    _lowerCAmelCase				=      degree * loga(SCREAMING_SNAKE_CASE_    )
    _lowerCAmelCase				=      int(SCREAMING_SNAKE_CASE_    )
    _lowerCAmelCase				=      calculate_prime_numbers(SCREAMING_SNAKE_CASE_    )

    _lowerCAmelCase				=      0
    _lowerCAmelCase				=      0
    _lowerCAmelCase				=      len(SCREAMING_SNAKE_CASE_    ) - 1
    while left < right:
        while (
            prime_numbers[right] * loga(prime_numbers[left]    )
            + prime_numbers[left] * loga(prime_numbers[right]    )
            > upper_bound
        ):
            right -= 1
        hybrid_integers_count += right - left
        left += 1

    return hybrid_integers_count


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


