





def _a				(	lowerCamelCase:   int )	->						bool:







      '''simple docstring'''






      if num < 0:
            return False

      __A          =				num
      __A          =				0
      while num > 0:
            __A          =				rev_num * 10 + (num % 10)
            num //= 10

      return num_copy == rev_num


if __name__ == "__main__":
       import doctest

       doctest.testmod()












from __future__ import annotations



def _a				(	lowerCamelCase:   list[int | str] )	->						None:







      '''simple docstring'''






      create_state_space_tree(lowerCamelCase					,				[]					,				0					,				[0 for i in range(len(lowerCamelCase ) )] )



def _a				(	lowerCamelCase:   list[int | str]					,				lowerCamelCase:   list[int | str]					,				lowerCamelCase:   int					,				lowerCamelCase:   list[int]					,				)	->						None:







      '''simple docstring'''






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

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

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







generate_all_permutations(sequence_a)





