




def 					lowerCamelCase_    (    SCREAMING_SNAKE_CASE   ):
			'''simple docstring'''
			SCREAMING_SNAKE_CASE           =					0
			while num > 0:
						digit_sum += num % 10
						num //= 10
			return digit_sum
def 					lowerCamelCase_    (    SCREAMING_SNAKE_CASE = 1_00   ):
			'''simple docstring'''
			SCREAMING_SNAKE_CASE           =					1
			SCREAMING_SNAKE_CASE           =					2

			for i in range(2					,	max_n + 1   ):
						SCREAMING_SNAKE_CASE           =					pre_numerator
						SCREAMING_SNAKE_CASE           =					2 * i // 3 if i % 3 == 0 else 1
						SCREAMING_SNAKE_CASE           =					cur_numerator
						SCREAMING_SNAKE_CASE           =					e_cont * pre_numerator + temp

			return sum_digits(SCREAMING_SNAKE_CASE   )


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









from __future__ import annotations
def 					lowerCamelCase_    (    SCREAMING_SNAKE_CASE   ):
			'''simple docstring'''
			create_state_space_tree(SCREAMING_SNAKE_CASE					,	[]					,	0					,	[0 for i in range(len(SCREAMING_SNAKE_CASE   )   )]   )
def 					lowerCamelCase_    (    SCREAMING_SNAKE_CASE					,	SCREAMING_SNAKE_CASE					,	SCREAMING_SNAKE_CASE					,	SCREAMING_SNAKE_CASE					,	):
			'''simple docstring'''

			if index == len(SCREAMING_SNAKE_CASE   ):
						print(SCREAMING_SNAKE_CASE   )
						return

			for i in range(len(SCREAMING_SNAKE_CASE   )   ):
						if not index_used[i]:
									current_sequence.append(sequence[i]   )
									SCREAMING_SNAKE_CASE           =					True
									create_state_space_tree(SCREAMING_SNAKE_CASE					,	SCREAMING_SNAKE_CASE					,	index + 1					,	SCREAMING_SNAKE_CASE   )
									current_sequence.pop()
									SCREAMING_SNAKE_CASE           =					False
__A						:							list[int | str]							=  [3, 1, 2, 4]
generate_all_permutations(sequence)

__A						:							list[int | str]							=  ["A", "B", "C"]




generate_all_permutations(sequence_a)






