

"""simple docstring"""
import math




def 					a__						(						lowerCAmelCase    )	-> bool:

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




def 					a__						(						lowerCAmelCase = 0.1    )	-> int:
      UpperCAmelCase__			:							Union[str, Any]							=    3
      UpperCAmelCase__			:							Optional[int]							=    3

      while primes / (2 * j - 1) >= ratio:
            for i in range(j * j + j + 1			,	(j + 2) * (j + 2)			,	j + 1    ):
                  primes += is_prime(lowerCAmelCase    )
            j += 2
      return j


if __name__ == "__main__":
    import doctest

    doctest.testmod()




"""simple docstring"""
from .glue import glue_convert_examples_to_features, glue_output_modes, glue_processors, glue_tasks_num_labels
from .squad import SquadExample, SquadFeatures, SquadVaProcessor, SquadVaProcessor, squad_convert_examples_to_features
from .utils import DataProcessor, InputExample, InputFeatures, SingleSentenceClassificationProcessor
from .xnli import xnli_output_modes, xnli_processors, xnli_tasks_num_labels

