import logging
import os
from dataclasses import dataclass, field
from typing import Dict, Optional

import numpy as np
from utils_multiple_choice import MultipleChoiceDataset, Split, processors

import transformers
from transformers import (
    AutoConfig,
    AutoModelForMultipleChoice,
    AutoTokenizer,
    DataCollatorWithPadding,
    EvalPrediction,
    HfArgumentParser,
    Trainer,
    TrainingArguments,
    set_seed,
)
from transformers.trainer_utils import is_main_process


_lowerCAmelCase       =		logging.getLogger(__name__)
def 					_snake_case	(  __snake_case  ,     __snake_case						):
					return (preds == labels).mean()
@dataclass
class     lowerCAmelCase_     :
							UpperCAmelCase				   =     field(
							    metadata={"help": "Path to pretrained model or model identifier from huggingface.co/models"} )
							UpperCAmelCase				   =     field(
							    default=__lowercase,  metadata={"help": "Pretrained config name or path if not the same as model_name"} )
							UpperCAmelCase				   =     field(
							    default=__lowercase,  metadata={"help": "Pretrained tokenizer name or path if not the same as model_name"} )
							UpperCAmelCase				   =     field(
							    default=__lowercase,  metadata={"help": "Where do you want to store the pretrained models downloaded from huggingface.co"},  )




@dataclass
class     lowerCAmelCase_     :
							UpperCAmelCase				   =     field(metadata={"help": "The name of the task to train on: " + ", ".join(processors.keys() )} )
							UpperCAmelCase				   =     field(metadata={"help": "Should contain the data files for the task."} )
							UpperCAmelCase				   =     field(
							    default=128,  metadata={
							        "help": (
							            "The maximum total input sequence length after tokenization. Sequences longer "
							            "than this will be truncated, sequences shorter will be padded."
							        )
							    },  )
							UpperCAmelCase				   =     field(
							    default=__lowercase,  metadata={"help": "Overwrite the cached training and evaluation sets"} )




def 					_snake_case	(  ):
					# See all possible arguments in src/transformers/training_args.py
					# or by passing the --help flag to this script.
					# We now keep distinct sets of args, for a cleaner separation of concerns.

					_UpperCamelCase			     =     HfArgumentParser((ModelArguments, DataTrainingArguments, TrainingArguments)						)
					_UpperCamelCase     ,    _UpperCamelCase     ,    _UpperCamelCase			     =     parser.parse_args_into_dataclasses()

					if (
					    os.path.exists(training_args.output_dir						)
					    and os.listdir(training_args.output_dir						)
					    and training_args.do_train
					    and not training_args.overwrite_output_dir
					):
										raise ValueError(
										    f"""Output directory ({training_args.output_dir}) already exists and is not empty. Use"""
										    ''' --overwrite_output_dir to overcome.'''						)

					# Setup logging
					logging.basicConfig(
					    format='''%(asctime)s - %(levelname)s - %(name)s - %(message)s'''  ,     datefmt='''%m/%d/%Y %H:%M:%S'''  ,     level=logging.INFO if training_args.local_rank in [-1, 0] else logging.WARN  ,     )
					logger.warning(
					    '''Process rank: %s, device: %s, n_gpu: %s, distributed training: %s, 16-bits training: %s'''  ,     training_args.local_rank  ,     training_args.device  ,     training_args.n_gpu  ,     bool(training_args.local_rank != -1						)  ,     training_args.fpaa  ,     )
					# Set the verbosity to info of the Transformers logger (on main process only):
					if is_main_process(training_args.local_rank						):
										transformers.utils.logging.set_verbosity_info()
										transformers.utils.logging.enable_default_handler()
										transformers.utils.logging.enable_explicit_format()
					logger.info('''Training/evaluation parameters %s'''  ,     __snake_case						)

					# Set seed
					set_seed(training_args.seed						)

					try:
										_UpperCamelCase			     =     processors[data_args.task_name]()
										_UpperCamelCase			     =     processor.get_labels()
										_UpperCamelCase			     =     len(__snake_case						)
					except KeyError:
										raise ValueError('''Task not found: %s''' % (data_args.task_name)						)

					# Load pretrained model and tokenizer
					#
					# Distributed training:
					# The .from_pretrained methods guarantee that only one local process can concurrently
					# download model & vocab.

					_UpperCamelCase			     =     AutoConfig.from_pretrained(
					    model_args.config_name if model_args.config_name else model_args.model_name_or_path  ,     num_labels=__snake_case  ,     finetuning_task=data_args.task_name  ,     cache_dir=model_args.cache_dir  ,     )
					_UpperCamelCase			     =     AutoTokenizer.from_pretrained(
					    model_args.tokenizer_name if model_args.tokenizer_name else model_args.model_name_or_path  ,     cache_dir=model_args.cache_dir  ,     )
					_UpperCamelCase			     =     AutoModelForMultipleChoice.from_pretrained(
					    model_args.model_name_or_path  ,     from_tf=bool('''.ckpt''' in model_args.model_name_or_path						)  ,     config=__snake_case  ,     cache_dir=model_args.cache_dir  ,     )

					# Get datasets
					_UpperCamelCase			     =     (
					    MultipleChoiceDataset(
					        data_dir=data_args.data_dir  ,     tokenizer=__snake_case  ,     task=data_args.task_name  ,     max_seq_length=data_args.max_seq_length  ,     overwrite_cache=data_args.overwrite_cache  ,     mode=Split.train  ,     )
					    if training_args.do_train
					    else None
					)
					_UpperCamelCase			     =     (
					    MultipleChoiceDataset(
					        data_dir=data_args.data_dir  ,     tokenizer=__snake_case  ,     task=data_args.task_name  ,     max_seq_length=data_args.max_seq_length  ,     overwrite_cache=data_args.overwrite_cache  ,     mode=Split.dev  ,     )
					    if training_args.do_eval
					    else None
					)

					def compute_metrics(__snake_case						) -> Dict:
										_UpperCamelCase			     =     np.argmax(p.predictions  ,     axis=1						)
										return {"acc": simple_accuracy(__snake_case  ,     p.label_ids						)}

					# Data collator
					_UpperCamelCase			     =     DataCollatorWithPadding(__snake_case  ,     pad_to_multiple_of=8						) if training_args.fpaa else None

					# Initialize our Trainer
					_UpperCamelCase			     =     Trainer(
					    model=__snake_case  ,     args=__snake_case  ,     train_dataset=__snake_case  ,     eval_dataset=__snake_case  ,     compute_metrics=__snake_case  ,     data_collator=__snake_case  ,     )

					# Training
					if training_args.do_train:
										trainer.train(
										    model_path=model_args.model_name_or_path if os.path.isdir(model_args.model_name_or_path						) else None						)
										trainer.save_model()
										# For convenience, we also re-save the tokenizer to the same directory,
										# so that you can share your model easily on huggingface.co/models =)
										if trainer.is_world_master():
															tokenizer.save_pretrained(training_args.output_dir						)

    # Evaluation
					_UpperCamelCase			     =     {}
					if training_args.do_eval:
										logger.info('''*** Evaluate ***'''						)

										_UpperCamelCase			     =     trainer.evaluate()

										_UpperCamelCase			     =     os.path.join(training_args.output_dir  ,     '''eval_results.txt'''						)
										if trainer.is_world_master():
															with open(__snake_case  ,     '''w'''						) as writer:
																				logger.info('''***** Eval results *****'''						)
																				for key, value in result.items():
																									logger.info('''  %s = %s'''  ,     __snake_case  ,     __snake_case						)
																									writer.write('''%s = %s\n''' % (key, value)						)

																				results.update(__snake_case						)

					return results
def 					_snake_case	(  __snake_case						):
					# For xla_spawn (TPUs)
					main()


if __name__ == "__main__":
					main()

"""simple docstring"""


from math import sqrt





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   bool:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (
						    number >= 0
						), "'number' must been an int and positive"

						lowerCamelCase__   =True

						# 0 and 1 are none primes.
						if number <= 1:
												lowerCamelCase__   =False

						for divisor in range(2  ,       int(round(sqrt(__lowerCAmelCase							)							)							) + 1							):
												# if 'number' divisible by 'divisor' then sets 'status'
												# of false and break up the loop.
												if number % divisor == 0:
																		lowerCamelCase__   =False
																		break

    # precondition
						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							), "'status' must been from type bool"

						return status





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   List[str]:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (n > 2), "'N' must been an int and > 2"

						# beginList: contains all natural numbers from 2 up to N
						lowerCamelCase__   =list(range(2  ,       n + 1							)							)

						lowerCamelCase__   =[]  # this list will be returns.

						# actual sieve of erathostenes
						for i in range(len(__lowerCAmelCase							)							):
												for j in range(i + 1  ,       len(__lowerCAmelCase							)							):
																		if (begin_list[i] != 0) and (begin_list[j] % begin_list[i] == 0):
																								lowerCamelCase__   =0

    # filters actual prime numbers.
						lowerCamelCase__   =[x for x in begin_list if x != 0]

						# precondition
						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							), "'ans' must been from type list"

						return ans





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   Optional[int]:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (n > 2), "'N' must been an int and > 2"

						lowerCamelCase__   =[]

						# iterates over all numbers between 2 up to N+1
						# if a number is prime then appends to list 'ans'
						for number in range(2  ,       n + 1							):
												if is_prime(__lowerCAmelCase							):
																		ans.append(__lowerCAmelCase							)

    # precondition
						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							), "'ans' must been from type list"

						return ans





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   Union[str, Any]:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and number >= 0, "'number' must been an int and >= 0"

						lowerCamelCase__   =[]  # this list will be returns of the function.

						# potential prime number factors.

						lowerCamelCase__   =2

						lowerCamelCase__   =number

						if number == 0 or number == 1:
												ans.append(__lowerCAmelCase							)

						# if 'number' not prime then builds the prime factorization of 'number'
						elif not is_prime(__lowerCAmelCase							):
												while quotient != 1:
																		if is_prime(__lowerCAmelCase							) and (quotient % factor == 0):
																								ans.append(__lowerCAmelCase							)
																								quotient /= factor
																		else:
																								factor += 1

						else:
												ans.append(__lowerCAmelCase							)

						# precondition
						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							), "'ans' must been from type list"

						return ans





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   Optional[int]:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (
						    number >= 0
						), "'number' bust been an int and >= 0"

						lowerCamelCase__   =0

						# prime factorization of 'number'
						lowerCamelCase__   =prime_factorization(__lowerCAmelCase							)

						lowerCamelCase__   =max(__lowerCAmelCase							)

						# precondition
						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							), "'ans' must been from type int"

						return ans





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   List[Any]:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (
						    number >= 0
						), "'number' bust been an int and >= 0"

						lowerCamelCase__   =0

						# prime factorization of 'number'
						lowerCamelCase__   =prime_factorization(__lowerCAmelCase							)

						lowerCamelCase__   =min(__lowerCAmelCase							)

						# precondition
						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							), "'ans' must been from type int"

						return ans





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   Union[str, Any]:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							), "'number' must been an int"
						assert isinstance(number % 2 == 0  ,       __lowerCAmelCase							), "compare bust been from type bool"

						return number % 2 == 0





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   List[Any]:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							), "'number' must been an int"
						assert isinstance(number % 2 != 0  ,       __lowerCAmelCase							), "compare bust been from type bool"

						return number % 2 != 0





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   int:




						'''simple docstring'''



						assert (
						    isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (number > 2) and is_even(__lowerCAmelCase							)
						), "'number' must been an int, even and > 2"

						lowerCamelCase__   =[]  # this list will returned

						# creates a list of prime numbers between 2 up to 'number'
						lowerCamelCase__   =get_prime_numbers(__lowerCAmelCase							)
						lowerCamelCase__   =len(__lowerCAmelCase							)

						# run variable for while-loops.
						lowerCamelCase__   =0
						lowerCamelCase__   =None

						# exit variable. for break up the loops
						lowerCamelCase__   =True

						while i < len_pn and loop:
												lowerCamelCase__   =i + 1

												while j < len_pn and loop:
																		if prime_numbers[i] + prime_numbers[j] == number:
																								lowerCamelCase__   =False
																								ans.append(prime_numbers[i]							)
																								ans.append(prime_numbers[j]							)

																		j += 1

												i += 1

						# precondition
						assert (
						    isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							)
						    and (len(__lowerCAmelCase							) == 2)
						    and (ans[0] + ans[1] == number)
						    and is_prime(ans[0]							)
						    and is_prime(ans[1]							)
						), "'ans' must contains two primes. And sum of elements must been eq 'number'"

						return ans





def      lowerCamelCase_					(   __lowerCAmelCase  ,       __lowerCAmelCase							)				->   Tuple:




						'''simple docstring'''



						assert (
						    isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							)
						    and isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							)
						    and (numbera >= 0)
						    and (numbera >= 0)
						), "'number1' and 'number2' must been positive integer."

						lowerCamelCase__   =0

						while numbera != 0:
												lowerCamelCase__   =numbera % numbera
												lowerCamelCase__   =numbera
												lowerCamelCase__   =rest

						# precondition
						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (
						    numbera >= 0
						), "'number' must been from type int and positive"

						return numbera





def      lowerCamelCase_					(   __lowerCAmelCase  ,       __lowerCAmelCase							)				->   Union[str, Any]:




						'''simple docstring'''



						assert (
						    isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							)
						    and isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							)
						    and (numbera >= 1)
						    and (numbera >= 1)
						), "'number1' and 'number2' must been positive integer."

						lowerCamelCase__   =1  # actual answer that will be return.

						# for kgV (x,1)
						if numbera > 1 and numbera > 1:
												# builds the prime factorization of 'number1' and 'number2'
												lowerCamelCase__   =prime_factorization(__lowerCAmelCase							)
												lowerCamelCase__   =prime_factorization(__lowerCAmelCase							)

						elif numbera == 1 or numbera == 1:
												lowerCamelCase__   =[]
												lowerCamelCase__   =[]
												lowerCamelCase__   =max(__lowerCAmelCase  ,       __lowerCAmelCase							)

						lowerCamelCase__   =0
						lowerCamelCase__   =0

						lowerCamelCase__   =[]  # captured numbers int both 'primeFac1' and 'primeFac2'

						# iterates through primeFac1
						for n in prime_fac_a:
												if n not in done:
																		if n in prime_fac_a:
																								lowerCamelCase__   =prime_fac_a.count(__lowerCAmelCase							)
																								lowerCamelCase__   =prime_fac_a.count(__lowerCAmelCase							)

																								for _ in range(max(__lowerCAmelCase  ,       __lowerCAmelCase							)							):
																														ans *= n

																		else:
																								lowerCamelCase__   =prime_fac_a.count(__lowerCAmelCase							)

																								for _ in range(__lowerCAmelCase							):
																														ans *= n

																		done.append(__lowerCAmelCase							)

    # iterates through primeFac2
						for n in prime_fac_a:
												if n not in done:
																		lowerCamelCase__   =prime_fac_a.count(__lowerCAmelCase							)

																		for _ in range(__lowerCAmelCase							):
																								ans *= n

																		done.append(__lowerCAmelCase							)

    # precondition
						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (
						    ans >= 0
						), "'ans' must been from type int and positive"

						return ans





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   Optional[Any]:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (n >= 0), "'number' must been a positive int"

						lowerCamelCase__   =0
						lowerCamelCase__   =2  # this variable holds the answer

						while index < n:
												index += 1

												ans += 1  # counts to the next number

												# if ans not prime then
												# runs to the next prime number.
												while not is_prime(__lowerCAmelCase							):
																		ans += 1

    # precondition
						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and is_prime(
						    __lowerCAmelCase							), "'ans' must been a prime number and from type int"

						return ans





def      lowerCamelCase_					(   __lowerCAmelCase  ,       __lowerCAmelCase							)				->   int:




						'''simple docstring'''



						assert (
						    is_prime(__lowerCAmelCase							) and is_prime(__lowerCAmelCase							) and (p_number_a < p_number_a)
						), "The arguments must been prime numbers and 'pNumber1' < 'pNumber2'"

						lowerCamelCase__   =p_number_a + 1  # jump to the next number

						lowerCamelCase__   =[]  # this list will be returns.

						# if number is not prime then
						# fetch the next prime number.
						while not is_prime(__lowerCAmelCase							):
												number += 1

						while number < p_number_a:
												ans.append(__lowerCAmelCase							)

												number += 1

												# fetch the next prime number.
												while not is_prime(__lowerCAmelCase							):
																		number += 1

    # precondition
						assert (
						    isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							)
						    and ans[0] != p_number_a
						    and ans[len(__lowerCAmelCase							) - 1] != p_number_a
						), "'ans' must been a list without the arguments"

						# 'ans' contains not 'pNumber1' and 'pNumber2' !
						return ans





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   int:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (n >= 1), "'n' must been int and >= 1"

						lowerCamelCase__   =[]  # will be returned.

						for divisor in range(1  ,       n + 1							):
												if n % divisor == 0:
																		ans.append(__lowerCAmelCase							)

    # precondition
						assert ans[0] == 1 and ans[len(__lowerCAmelCase							) - 1] == n, "Error in function getDivisiors(...)"

						return ans





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   Union[str, Any]:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (
						    number > 1
						), "'number' must been an int and >= 1"

						lowerCamelCase__   =get_divisors(__lowerCAmelCase							)

						# precondition
						assert (
						    isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							)
						    and (divisors[0] == 1)
						    and (divisors[len(__lowerCAmelCase							) - 1] == number)
						), "Error in help-function getDivisiors(...)"

						# summed all divisors up to 'number' (exclusive), hence [:-1]
						return sum(divisors[:-1]							) == number





def      lowerCamelCase_					(   __lowerCAmelCase  ,       __lowerCAmelCase							)				->   Dict:




						'''simple docstring'''



						assert (
						    isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							)
						    and isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							)
						    and (denominator != 0)
						), "The arguments must been from type int and 'denominator' != 0"

						# build the greatest common divisor of numerator and denominator.
						lowerCamelCase__   =gcd(abs(__lowerCAmelCase							)  ,       abs(__lowerCAmelCase							)							)

						# precondition
						assert (
						    isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							)
						    and (numerator % gcd_of_fraction == 0)
						    and (denominator % gcd_of_fraction == 0)
						), "Error in function gcd(...,...)"

						return (numerator // gcd_of_fraction, denominator // gcd_of_fraction)





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   List[Any]:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (n >= 0), "'n' must been a int and >= 0"

						lowerCamelCase__   =1  # this will be return.

						for factor in range(1  ,       n + 1							):
												ans *= factor

						return ans





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   Tuple:




						'''simple docstring'''



						assert isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							) and (n >= 0), "'n' must been an int and >= 0"

						lowerCamelCase__   =0
						lowerCamelCase__   =1
						lowerCamelCase__   =1  # this will be return

						for _ in range(n - 1							):
												lowerCamelCase__   =ans
												ans += fiba
												lowerCamelCase__   =tmp

						return ans


