"""simple docstring"""


from ...configuration_utils import PretrainedConfig
from ...utils import logging


lowerCAmelCase_:					int     =					logging.get_logger(__name__)

lowerCAmelCase_:					Optional[Any]     =					{
    "google/fnet-base": "https://huggingface.co/google/fnet-base/resolve/main/config.json",
    "google/fnet-large": "https://huggingface.co/google/fnet-large/resolve/main/config.json"
    # See all FNet models at https://huggingface.co/models?filter=fnet
}






class    a__    (   _a	):
   snake_case_							=      "fnet"


   def __init__(     self,				_UpperCAmelCase=3_2000,				_UpperCAmelCase=768,				_UpperCAmelCase=12,				_UpperCAmelCase=3072,				_UpperCAmelCase="gelu_new",				_UpperCAmelCase=0.1,				_UpperCAmelCase=512,				_UpperCAmelCase=4,				_UpperCAmelCase=0.02,				_UpperCAmelCase=1E-12,				_UpperCAmelCase=False,				_UpperCAmelCase=512,				_UpperCAmelCase=3,				_UpperCAmelCase=1,				_UpperCAmelCase=2,				**_UpperCAmelCase,				):
        '''simple docstring'''



        super().__init__(pad_token_id=_UpperCAmelCase,				bos_token_id=_UpperCAmelCase,				eos_token_id=_UpperCAmelCase,				**_UpperCAmelCase  )

        lowercase__				 =							vocab_size
        lowercase__				 =							max_position_embeddings
        lowercase__				 =							hidden_size
        lowercase__				 =							num_hidden_layers
        lowercase__				 =							intermediate_size
        lowercase__				 =							hidden_act
        lowercase__				 =							hidden_dropout_prob
        lowercase__				 =							initializer_range
        lowercase__				 =							type_vocab_size
        lowercase__				 =							layer_norm_eps
        lowercase__				 =							use_tpu_fourier_optimizations
        lowercase__				 =							tpu_short_seq_length
"""simple docstring"""


import itertools
import math







def 					__a   (		A      ):






     '''simple docstring'''



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







def 					__a   (		):






     '''simple docstring'''



     lowercase__				 =							2
     while True:
          if is_prime(A      ):
               yield num
          num += 1







def 					__a   (		A = 1_00_01      ):






     '''simple docstring'''



     return next(itertools.islice(prime_generator()    ,				nth - 1    ,				A      )      )


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




