



'''simple docstring'''

from .data_collator import (
    DataCollatorForLanguageModeling,
    DataCollatorForPermutationLanguageModeling,
    DataCollatorForSeqaSeq,
    DataCollatorForSOP,
    DataCollatorForTokenClassification,
    DataCollatorForWholeWordMask,
    DataCollatorWithPadding,
    DefaultDataCollator,
    default_data_collator,
)
from .metrics import glue_compute_metrics, xnli_compute_metrics
from .processors import (
    DataProcessor,
    InputExample,
    InputFeatures,
    SingleSentenceClassificationProcessor,
    SquadExample,
    SquadFeatures,
    SquadVaProcessor,
    SquadVaProcessor,
    glue_convert_examples_to_features,
    glue_output_modes,
    glue_processors,
    glue_tasks_num_labels,
    squad_convert_examples_to_features,
    xnli_output_modes,
    xnli_processors,
    xnli_tasks_num_labels,
)









'''simple docstring'''

def      __lowerCamelCase     (      )			->      Tuple:
		for n in range(1						,			1000000  ):
				yield n * (n + 1) // 2



def      __lowerCamelCase     (      lowerCAmelCase_  )			->      List[Any]:
		_a     :      Any        =							1
		_a     :      Tuple        =							2
		while i * i <= n:
				_a     :      Tuple        =							0
				while n % i == 0:
						n //= i
						multiplicity += 1
				divisors_count *= multiplicity + 1
				i += 1
		if n > 1:
				divisors_count *= 2
		return divisors_count



def      __lowerCamelCase     (      )			->      str:
		return next(i for i in triangle_number_generator() if count_divisors(lowerCAmelCase_  ) > 500  )


if __name__ == "__main__":
							print(solution())




