





"""simple docstring"""





from torch import nn

class 		lowercase					(					nn.Module					):





      def __init__(       self      ,						lowercase      ,						lowercase )		->     Union[str, Any]:
            super().__init__()
            lowerCAmelCase  						=       class_size
            lowerCAmelCase  						=       embed_size
            # self.mlp1 = nn.Linear(embed_size, embed_size)
            # self.mlp2 = (nn.Linear(embed_size, class_size))
            lowerCAmelCase  						=       nn.Linear(__a      ,						__a )





      def     _snake_case			(       self      ,						lowercase )		->     List[str]:
            lowerCAmelCase  						=       self.mlp(__a )
            return logits














import math
def 					snake_case_						(   lowerCAmelCase_				:  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(lowerCAmelCase_					) + 1					)				,				6					):
														if number % i == 0 or number % (i + 2) == 0:
																					return False
							return True
def 					snake_case_						(   lowerCAmelCase_				:  int = 10001					):

							try:
														__lowercase					:							Optional[int]			=   int(lowerCAmelCase_					)
							except (TypeError, ValueError):
														raise TypeError("""Parameter nth must be int or castable to int."""					) from None
							if nth <= 0:
														raise ValueError("""Parameter nth must be greater than or equal to one."""					)
							__lowercase					:							list[int]			=   []
							__lowercase					:							str			=   2
							while len(lowerCAmelCase_					) < nth:
														if is_prime(lowerCAmelCase_					):
																					primes.append(lowerCAmelCase_					)
																					num += 1
														else:
																					num += 1
							return primes[len(lowerCAmelCase_					) - 1]


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