



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


SCREAMING_SNAKE_CASE  					=    logging.get_logger(__name__)

SCREAMING_SNAKE_CASE  					=    {
    # See all MEGATRON_BERT models at https://huggingface.co/models?filter=bert
}



class 						lowerCamelCase   (    lowercase__	):







					'''simple docstring'''







					lowerCAmelCase_					:     List[Any]					       =	'megatron-bert'



					def __init__(      self     ,						lowerCAmelCase=2_9056     ,						lowerCAmelCase=1024     ,						lowerCAmelCase=24     ,						lowerCAmelCase=16     ,						lowerCAmelCase=4096     ,						lowerCAmelCase="gelu"     ,						lowerCAmelCase=0.1     ,						lowerCAmelCase=0.1     ,						lowerCAmelCase=512     ,						lowerCAmelCase=2     ,						lowerCAmelCase=0.02     ,						lowerCAmelCase=1e-1_2     ,						lowerCAmelCase=0     ,						lowerCAmelCase="absolute"     ,						lowerCAmelCase=True     ,						**lowerCAmelCase     ,						):
							super().__init__(pad_token_id=A_     ,						**A_  )

							UpperCAmelCase_						       =					vocab_size
							UpperCAmelCase_						       =					hidden_size
							UpperCAmelCase_						       =					num_hidden_layers
							UpperCAmelCase_						       =					num_attention_heads
							UpperCAmelCase_						       =					hidden_act
							UpperCAmelCase_						       =					intermediate_size
							UpperCAmelCase_						       =					hidden_dropout_prob
							UpperCAmelCase_						       =					attention_probs_dropout_prob
							UpperCAmelCase_						       =					max_position_embeddings
							UpperCAmelCase_						       =					type_vocab_size
							UpperCAmelCase_						       =					initializer_range
							UpperCAmelCase_						       =					layer_norm_eps
							UpperCAmelCase_						       =					position_embedding_type
							UpperCAmelCase_						       =					use_cache





def    a__    (		snake_case__					:							int						,   snake_case__					:							int     ):
  return x if y == 0 else greatest_common_divisor(snake_case__						,   x % y     )




def    a__    (		snake_case__					:							int						,   snake_case__					:							int     ):
  return (x * y) // greatest_common_divisor(snake_case__						,   snake_case__     )




def    a__    (		snake_case__					:							int = 20     ):
  _UpperCAmelCase		:							Union[str, Any]							=     1
  for i in range(1						,   n + 1     ):
    _UpperCAmelCase		:							Dict							=     lcm(snake_case__						,   snake_case__     )
  return g


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





