from unittest.mock import Mock, patch

from file_transfer.send_file import send_file



@patch("""socket.socket"""     )
@patch("""builtins.open"""     )
def      __SCREAMING_SNAKE_CASE  ( __UpperCamelCase   :	Optional[int]			,					__UpperCamelCase   :	List[str]     )							-> int:







  """simple docstring"""





  SCREAMING_SNAKE_CASE__      							=				Mock()
  SCREAMING_SNAKE_CASE__      							=				conn, Mock()
  SCREAMING_SNAKE_CASE__      							=				iter([1, None]     )
  SCREAMING_SNAKE_CASE__      							=				lambda __UpperCamelCase     : next(__UpperCamelCase     )

  # ===== invoke =====
  send_file(filename="""mytext.txt"""			,					testing=__UpperCamelCase     )

  # ===== ensurance =====
  sock.assert_called_once()
  sock.return_value.bind.assert_called_once()
  sock.return_value.listen.assert_called_once()
  sock.return_value.accept.assert_called_once()
  conn.recv.assert_called_once()

  file.return_value.__enter__.assert_called_once()
  file.return_value.__enter__.return_value.read.assert_called()

  conn.send.assert_called_once()
  conn.close.assert_called_once()
  sock.return_value.shutdown.assert_called_once()
  sock.return_value.close.assert_called_once()

from math import isqrt



def      __SCREAMING_SNAKE_CASE  ( __UpperCamelCase   :	int     )							-> list[int]:







  """simple docstring"""





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

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



def      __SCREAMING_SNAKE_CASE  ( __UpperCamelCase   :	int = 10**8     )							-> int:







  """simple docstring"""





  SCREAMING_SNAKE_CASE__      							=				calculate_prime_numbers(max_number // 2     )

  SCREAMING_SNAKE_CASE__      							=				0
  SCREAMING_SNAKE_CASE__      							=				0
  SCREAMING_SNAKE_CASE__      							=				len(__UpperCamelCase     ) - 1
  while left <= right:
    while prime_numbers[left] * prime_numbers[right] >= max_number:
      right -= 1
    semiprimes_count += right - left + 1
    left += 1

  return semiprimes_count


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