


'''simple docstring'''







import argparse

import torch

from transformers import RoFormerConfig, RoFormerForMaskedLM, load_tf_weights_in_roformer
from transformers.utils import logging


logging.set_verbosity_info()







def _UpperCamelCase	(					__A				,      __A				,      __A   )							->		int:


      '''simple docstring'''



      UpperCamelCase__  =    RoFormerConfig.from_json_file(__A   )
      print(F'''Building PyTorch model from configuration: {config}'''   )
      UpperCamelCase__  =    RoFormerForMaskedLM(__A   )

      # Load weights from tf checkpoint
      load_tf_weights_in_roformer(__A				,      __A				,      __A   )

      # Save pytorch-model
      print(F'''Save PyTorch model to {pytorch_dump_path}'''   )
      torch.save(model.state_dict()				,      __A				,      _use_new_zipfile_serialization=__A   )


if __name__ == "__main__":
  a__  : int				=	argparse.ArgumentParser()
  # Required parameters
  parser.add_argument(
      '--tf_checkpoint_path', default=None, type=str, required=True, help='Path to the TensorFlow checkpoint path.'
  )
  parser.add_argument(
      '--bert_config_file',
      default=None,
      type=str,
      required=True,
      help=(
          'The config json file corresponding to the pre-trained BERT model. \n'
          'This specifies the model architecture.'
      ),
  )
  parser.add_argument(
      '--pytorch_dump_path', default=None, type=str, required=True, help='Path to the output PyTorch model.'
  )
  a__  : List[Any]				=	parser.parse_args()
  convert_tf_checkpoint_to_pytorch(args.tf_checkpoint_path, args.bert_config_file, args.pytorch_dump_path)









'''simple docstring'''







import math







def _UpperCamelCase	(					__A   )							->		bool:


      '''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 _UpperCamelCase	(					__A = 1000				,      __A = 1000   )							->		int:


      '''simple docstring'''



      UpperCamelCase__  =    [0, 0, 0]  # length, a, b
      for a in range((a_limit * -1) + 1				,      __A   ):
            for b in range(2				,      __A   ):
                  if is_prime(__A   ):
                        UpperCamelCase__  =    0
                        UpperCamelCase__  =    0
                        while is_prime((n**2) + (a * n) + b   ):
                              count += 1
                              n += 1
                        if count > longest[0]:
                              UpperCamelCase__  =    [count, a, b]
      UpperCamelCase__  =    longest[1] * longest[2]
      return ans


if __name__ == "__main__":
  print(solution(1_0_0_0, 1_0_0_0))





