from __future__ import annotations


def      a__ (		__UpperCamelCase     ,      __UpperCamelCase				):
      SCREAMING_SNAKE_CASE_          =  []
      SCREAMING_SNAKE_CASE_          =  []
      SCREAMING_SNAKE_CASE_          =  0
      SCREAMING_SNAKE_CASE_          =  sum(__UpperCamelCase				)
      create_state_space_tree(__UpperCamelCase     ,      __UpperCamelCase     ,      __UpperCamelCase     ,      __UpperCamelCase     ,      __UpperCamelCase     ,      __UpperCamelCase				)
      return result


def      a__ (		__UpperCamelCase     ,      __UpperCamelCase     ,      __UpperCamelCase     ,      __UpperCamelCase     ,      __UpperCamelCase     ,      __UpperCamelCase     ,      ):
      if sum(__UpperCamelCase				) > max_sum or (remaining_nums_sum + sum(__UpperCamelCase				)) < max_sum:
            return
      if sum(__UpperCamelCase				) == max_sum:
            result.append(__UpperCamelCase				)
            return
      for index in range(__UpperCamelCase     ,      len(__UpperCamelCase				)				):
            create_state_space_tree(
                __UpperCamelCase     ,      __UpperCamelCase     ,      index + 1     ,      [*path, nums[index]]     ,      __UpperCamelCase     ,      remaining_nums_sum - nums[index]     ,      )
A     :  int					     =       [3, 34, 4, 12, 5, 2]
A     :  List[Any]					     =       9
A     :  Tuple					     =       generate_sum_of_subsets_soln(nums, max_sum)





print(*result)



from math import factorial


def      a__ (		__UpperCamelCase = 1_0_0				):
      return sum(int(__UpperCamelCase				) for x in str(factorial(__UpperCamelCase				)				)				)


if __name__ == "__main__":
      print(solution(int(input("Enter the Number: ").strip())))


