




def 	_a      (						SCREAMING_SNAKE_CASE_							:				int = 1      ,      SCREAMING_SNAKE_CASE_							:				Optional[int] = 10_00     ):
					__lowerCAmelCase				   =       1
					__lowerCAmelCase				   =       0

					for divide_by_number in range(SCREAMING_SNAKE_CASE_      ,      digit + 1     ):
										__lowerCAmelCase				   =       []
										__lowerCAmelCase				   =       numerator
										for _ in range(1      ,      digit + 1     ):
															if now_divide in has_been_divided:
																				if longest_list_length < len(SCREAMING_SNAKE_CASE_     ):
																									__lowerCAmelCase				   =       len(SCREAMING_SNAKE_CASE_     )
																									__lowerCAmelCase				   =       divide_by_number
															else:
																				has_been_divided.append(SCREAMING_SNAKE_CASE_     )
																				__lowerCAmelCase				   =       now_divide * 10 % divide_by_number

					return the_digit


# Tests
if __name__ == "__main__":
					import doctest

					doctest.testmod()





'''simple docstring'''

def 			__UpperCamelCase       (   UpperCAmelCase     ):
 lowercase__				:    List[str]  =					0
 while num > 0:
  digit_sum += num % 10
  num //= 10
 return digit_sum
def 			__UpperCamelCase       (   UpperCAmelCase = 100     ):
 lowercase__				:    Dict  =					1
 lowercase__				:    Optional[int]  =					2

 for i in range(2		,     max_n + 1     ):
  lowercase__				:    List[str]  =					pre_numerator
  lowercase__				:    Optional[Any]  =					2 * i // 3 if i % 3 == 0 else 1
  lowercase__				:    Union[str, Any]  =					cur_numerator
  lowercase__				:    int  =					e_cont * pre_numerator + temp

 return sum_digits(UpperCAmelCase     )


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

