


from math import factorial

UpperCAmelCase__   	=							{str(digit): factorial(digit) for digit in range(10)}
def 				UpperCAmelCase_					(							__snake_case						)     ->			int:







 """simple docstring"""


 if not isinstance(__snake_case     ,						__snake_case						):
  raise TypeError('''Parameter number must be int'''						)

 if number < 0:
  raise ValueError('''Parameter number must be greater than or equal to 0'''						)

 # Converts number in string to iterate on its digits and adds its factorial.
 return sum(DIGIT_FACTORIAL[digit] for digit in str(__snake_case						)						)
def 				UpperCAmelCase_					(							__snake_case = 60     ,						__snake_case = 1000000						)     ->			int:







 """simple docstring"""


 if not isinstance(__snake_case     ,						__snake_case						) or not isinstance(__snake_case     ,						__snake_case						):
  raise TypeError('''Parameters chain_length and number_limit must be int'''						)

 if chain_length <= 0 or number_limit <= 0:
  raise ValueError(
      '''Parameters chain_length and number_limit must be greater than 0'''						)

 # the counter for the chains with the exact desired length
 _lowercase							      =0
 # the cached sizes of the previous chains
 _lowercase							      ={}

 for start_chain_element in range(1     ,						__snake_case						):
  # The temporary set will contain the elements of the chain
  _lowercase							      =set()
  _lowercase							      =0

  # Stop computing the chain when you find a cached size, a repeating item or the
  # length is greater then the desired one.
  _lowercase							      =start_chain_element
  while (
      chain_element not in chain_sets_lengths
      and chain_element not in chain_set
      and chain_set_length <= chain_length
  ):
   chain_set.add(__snake_case						)
   chain_set_length += 1
   _lowercase							      =digit_factorial_sum(__snake_case						)

  if chain_element in chain_sets_lengths:
   chain_set_length += chain_sets_lengths[chain_element]

  _lowercase							      =chain_set_length

  # If chain contains the exact amount of elements increase the counter
  if chain_set_length == chain_length:
   chains_counter += 1

 return chains_counter


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  print(f'''{solution()}''')



"""simple docstring"""





from collections import OrderedDict
from typing import Mapping

from ...configuration_utils import PretrainedConfig
from ...onnx import OnnxConfig


_a		       =							{
    'albert-base-v1': 'https://huggingface.co/albert-base-v1/resolve/main/config.json',
    'albert-large-v1': 'https://huggingface.co/albert-large-v1/resolve/main/config.json',
    'albert-xlarge-v1': 'https://huggingface.co/albert-xlarge-v1/resolve/main/config.json',
    'albert-xxlarge-v1': 'https://huggingface.co/albert-xxlarge-v1/resolve/main/config.json',
    'albert-base-v2': 'https://huggingface.co/albert-base-v2/resolve/main/config.json',
    'albert-large-v2': 'https://huggingface.co/albert-large-v2/resolve/main/config.json',
    'albert-xlarge-v2': 'https://huggingface.co/albert-xlarge-v2/resolve/main/config.json',
    'albert-xxlarge-v2': 'https://huggingface.co/albert-xxlarge-v2/resolve/main/config.json',
}


class A_	(lowercase__      ):




  '''simple docstring'''
  SCREAMING_SNAKE_CASE__			:						Optional[Any]       =		"""albert"""







  def __init__(		self				,   lowercase_=3_0000				,   lowercase_=128				,   lowercase_=4096				,   lowercase_=12				,   lowercase_=1				,   lowercase_=64				,   lowercase_=1_6384				,   lowercase_=1				,   lowercase_="gelu_new"				,   lowercase_=0				,   lowercase_=0				,   lowercase_=512				,   lowercase_=2				,   lowercase_=0.02				,   lowercase_=1E-1_2				,   lowercase_=0.1				,   lowercase_="absolute"				,   lowercase_=0				,   lowercase_=2				,   lowercase_=3				,   **lowercase_				,   ):

     """simple docstring"""
     super().__init__(pad_token_id=lowercase_				,   bos_token_id=lowercase_				,   eos_token_id=lowercase_				,   **lowercase_  )

     UpperCAmelCase_					:					int			     =    vocab_size
     UpperCAmelCase_					:					Optional[int]			     =    embedding_size
     UpperCAmelCase_					:					List[str]			     =    hidden_size
     UpperCAmelCase_					:					Optional[int]			     =    num_hidden_layers
     UpperCAmelCase_					:					Union[str, Any]			     =    num_hidden_groups
     UpperCAmelCase_					:					Dict			     =    num_attention_heads
     UpperCAmelCase_					:					Any			     =    inner_group_num
     UpperCAmelCase_					:					Union[str, Any]			     =    hidden_act
     UpperCAmelCase_					:					Union[str, Any]			     =    intermediate_size
     UpperCAmelCase_					:					List[str]			     =    hidden_dropout_prob
     UpperCAmelCase_					:					Union[str, Any]			     =    attention_probs_dropout_prob
     UpperCAmelCase_					:					Optional[Any]			     =    max_position_embeddings
     UpperCAmelCase_					:					Any			     =    type_vocab_size
     UpperCAmelCase_					:					List[str]			     =    initializer_range
     UpperCAmelCase_					:					Optional[int]			     =    layer_norm_eps
     UpperCAmelCase_					:					List[Any]			     =    classifier_dropout_prob
     UpperCAmelCase_					:					Tuple			     =    position_embedding_type




class A_	(lowercase__      ):




  '''simple docstring'''







  @property
  def        UpperCamelCase__					(		self  ):

     """simple docstring"""
     if self.task == "multiple-choice":
        UpperCAmelCase_					:					int			     =    {0: "batch", 1: "choice", 2: "sequence"}
     else:
        UpperCAmelCase_					:					Optional[Any]			     =    {0: "batch", 1: "sequence"}
     return OrderedDict(
         [
             ("input_ids", dynamic_axis),
             ("attention_mask", dynamic_axis),
             ("token_type_ids", dynamic_axis),
         ]  )


