

'''simple docstring'''







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


__lowerCamelCase		       =    logging.get_logger(__name__)

__lowerCamelCase		       =    {
    '''s-JoL/Open-Llama-V1''': '''https://huggingface.co/s-JoL/Open-Llama-V1/blob/main/config.json''',
}


class 					A__      (      _snake_case			):
    lowercase						=		"open-llama"



    def __init__(					self		,				UpperCamelCase__=100000		,				UpperCamelCase__=4096		,				UpperCamelCase__=11008		,				UpperCamelCase__=32		,				UpperCamelCase__=32		,				UpperCamelCase__="silu"		,				UpperCamelCase__=2048		,				UpperCamelCase__=0.02		,				UpperCamelCase__=1e-6		,				UpperCamelCase__=True		,				UpperCamelCase__=0		,				UpperCamelCase__=1		,				UpperCamelCase__=2		,				UpperCamelCase__=False		,				UpperCamelCase__=True		,				UpperCamelCase__=0.1		,				UpperCamelCase__=0.1		,				UpperCamelCase__=True		,				UpperCamelCase__=True		,				UpperCamelCase__=None		,				**UpperCamelCase__		,				)						->      int:





           '''simple docstring'''
           A_						=      vocab_size
           A_						=      max_position_embeddings
           A_						=      hidden_size
           A_						=      intermediate_size
           A_						=      num_hidden_layers
           A_						=      num_attention_heads
           A_						=      hidden_act
           A_						=      initializer_range
           A_						=      rms_norm_eps
           A_						=      use_cache
           A_						=      kwargs.pop(
               """use_memorry_efficient_attention"""		,				UpperCamelCase__       )
           A_						=      hidden_dropout_prob
           A_						=      attention_dropout_prob
           A_						=      use_stable_embedding
           A_						=      shared_input_output_embedding
           A_						=      rope_scaling
           self._rope_scaling_validation()

           super().__init__(
               pad_token_id=UpperCamelCase__		,				bos_token_id=UpperCamelCase__		,				eos_token_id=UpperCamelCase__		,				tie_word_embeddings=UpperCamelCase__		,				**UpperCamelCase__		,				)







    def 					snake_case_			(					self       )						->      Dict:





           '''simple docstring'''
           if self.rope_scaling is None:
                  return

           if not isinstance(self.rope_scaling		,				UpperCamelCase__       ) or len(self.rope_scaling       ) != 2:
                  raise ValueError(
                      """`rope_scaling` must be a dictionary with with two fields, `name` and `factor`, """
                      f'''got {self.rope_scaling}'''       )
           A_						=      self.rope_scaling.get("""type"""		,				UpperCamelCase__       )
           A_						=      self.rope_scaling.get("""factor"""		,				UpperCamelCase__       )
           if rope_scaling_type is None or rope_scaling_type not in ["linear", "dynamic"]:
                  raise ValueError(
                      f'''`rope_scaling`\'s name field must be one of [\'linear\', \'dynamic\'], got {rope_scaling_type}'''       )
           if rope_scaling_factor is None or not isinstance(UpperCamelCase__		,				UpperCamelCase__       ) or rope_scaling_factor <= 1.0:
                  raise ValueError(f'''`rope_scaling`\'s factor field must be an float > 1, got {rope_scaling_factor}'''       )



'''simple docstring'''







__lowerCamelCase		       =    range(2, 20 + 1)
__lowerCamelCase		       =    [10**k for k in range(ks[-1] + 1)]
__lowerCamelCase		       =    {}
def       UpperCAmelCase__    (      UpperCAmelCase__,       UpperCAmelCase__,       UpperCAmelCase__,       UpperCAmelCase__				)			->			Tuple:
       A_						=      sum(a_i[j] for j in range(UpperCAmelCase__,       len(UpperCAmelCase__				)				)				)
       A_						=      sum(a_i[j] * base[j] for j in range(min(len(UpperCAmelCase__				),       UpperCAmelCase__				)				)				)

       A_					,			A_						=      0, 0
       A_						=      n - i

       A_						=      memo.get(UpperCAmelCase__				)

       if sub_memo is not None:
              A_						=      sub_memo.get(UpperCAmelCase__				)

              if jumps is not None and len(UpperCAmelCase__				) > 0:
                     # find and make the largest jump without going over
                     A_						=      -1
                     for _k in range(len(UpperCAmelCase__				) - 1,       -1,       -1				):
                            if jumps[_k][2] <= k and jumps[_k][1] <= max_dn:
                                   A_						=      _k
                                   break

                     if max_jump >= 0:
                            A_					,			A_					,			A_						=      jumps[max_jump]
                            # since the difference between jumps is cached, add c
                            A_						=      diff + c
                            for j in range(min(UpperCAmelCase__,       len(UpperCAmelCase__				)				)				):
                                   A_					,			A_						=      divmod(UpperCAmelCase__,       10				)
                            if new_c > 0:
                                   add(UpperCAmelCase__,       UpperCAmelCase__,       UpperCAmelCase__				)

              else:
                     A_						=      []
       else:
              A_						=      {c: []}
              A_						=      sub_memo

       if dn >= max_dn or c + diff >= base[k]:
              return diff, dn

       if k > ks[0]:
              while True:
                     # keep doing smaller jumps
                     A_					,			A_						=      next_term(UpperCAmelCase__,       k - 1,       i + dn,       UpperCAmelCase__				)
                     diff += _diff
                     dn += terms_jumped

                     if dn >= max_dn or c + diff >= base[k]:
                            break
       else:
              # would be too small a jump, just compute sequential terms instead
              A_					,			A_						=      compute(UpperCAmelCase__,       UpperCAmelCase__,       i + dn,       UpperCAmelCase__				)
              diff += _diff
              dn += terms_jumped

       A_						=      sub_memo[c]

       # keep jumps sorted by # of terms skipped
       A_						=      0
       while j < len(UpperCAmelCase__				):
              if jumps[j][1] > dn:
                     break
              j += 1

       # cache the jump for this value digitsum(b) and c
       sub_memo[c].insert(UpperCAmelCase__,       (diff, dn, k)				)
       return (diff, dn)
def       UpperCAmelCase__    (      UpperCAmelCase__,       UpperCAmelCase__,       UpperCAmelCase__,       UpperCAmelCase__				)			->			int:
       if i >= n:
              return 0, i
       if k > len(UpperCAmelCase__				):
              a_i.extend([0 for _ in range(k - len(UpperCAmelCase__				)				)]				)

       # note: a_i -> b * 10^k + c
       # ds_b -> digitsum(b)
       # ds_c -> digitsum(c)
       A_						=      i
       A_					,			A_					,			A_						=      0, 0, 0
       for j in range(len(UpperCAmelCase__				)				):
              if j >= k:
                     ds_b += a_i[j]
              else:
                     ds_c += a_i[j]

       while i < n:
              i += 1
              A_						=      ds_c + ds_b
              diff += addend
              A_						=      0
              for j in range(UpperCAmelCase__				):
                     A_						=      a_i[j] + addend
                     A_					,			A_						=      divmod(UpperCAmelCase__,       10				)

                     ds_c += a_i[j]

              if addend > 0:
                     break

       if addend > 0:
              add(UpperCAmelCase__,       UpperCAmelCase__,       UpperCAmelCase__				)
       return diff, i - start_i
def       UpperCAmelCase__    (      UpperCAmelCase__,       UpperCAmelCase__,       UpperCAmelCase__				)			->			str:
       for j in range(UpperCAmelCase__,       len(UpperCAmelCase__				)				):
              A_						=      digits[j] + addend
              if s >= 10:
                     A_					,			A_						=      divmod(UpperCAmelCase__,       10				)
                     A_						=      addend // 10 + quotient
              else:
                     A_						=      s
                     A_						=      addend // 10

              if addend == 0:
                     break

       while addend > 0:
              A_					,			A_						=      divmod(UpperCAmelCase__,       10				)
              digits.append(UpperCAmelCase__				)
def       UpperCAmelCase__    (      UpperCAmelCase__ = 10**15				)			->			int:
       A_						=      [1]
       A_						=      1
       A_						=      0
       while True:
              A_					,			A_						=      next_term(UpperCAmelCase__,       20,       i + dn,       UpperCAmelCase__				)
              dn += terms_jumped
              if dn == n - i:
                     break

       A_						=      0
       for j in range(len(UpperCAmelCase__				)				):
              a_n += digits[j] * 10**j
       return a_n


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