




def       lowerCAmelCase_      (	lowerCamelCase:							list  ,					lowerCamelCase:							list  ,					lowerCamelCase:							list  ,					lowerCamelCase:							int  ,					lowerCamelCase:							int    )       ->      None:


      '''simple docstring'''




      if target == 0:
            answer.append(path.copy()    )
      else:
            for index in range(__a  ,					len(__a    )    ):
                  if target >= candidates[index]:
                        path.append(candidates[index]    )
                        backtrack(__a  ,					__a  ,					__a  ,					target - candidates[index]  ,					__a    )
                        path.pop(len(__a    ) - 1    )

def       lowerCAmelCase_      (	lowerCamelCase:							list  ,					lowerCamelCase:							int    )       ->      list:


      '''simple docstring'''




      lowerCamelCase__   	=					[]  # type: list[int]
      lowerCamelCase__   	=					[]  # type: list[int]
      backtrack(__a  ,					__a  ,					__a  ,					__a  ,					0    )
      return answer

def       lowerCAmelCase_      (	)       ->      None:


      '''simple docstring'''




      print(combination_sum([-8, 2.3, 0]  ,					1    )    )


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      main()
def 	__lowerCamelCase							(				)      ->       Dict:
	_lowercase   =1

	while True:
		if (
		    sorted(str(__a		)		)
		    == sorted(str(2 * i		)		)
		    == sorted(str(3 * i		)		)
		    == sorted(str(4 * i		)		)
		    == sorted(str(5 * i		)		)
		    == sorted(str(6 * i		)		)
		):
			return i

		i += 1


if __name__ == "__main__":
						print(solution())




