input: Write a Python function that receives an array of integers and counts how many elements have a sum of their digits above zero. If an integer is negative, consider its signed digits in the sum, e.g., -123 has signed digits -1, 2, and 3.
  assert count_digits_sum([]) == 0
  assert count_digits_sum([-1, -2, 0]) == 0
  assert count_digits_sum([1, 1, 2, -2, 3, 4, 5]) == 6
  assert count_digits_sum([1, 6, 9, -6, 0, 1, 5]) == 5
  assert count_digits_sum([1, 100, 98, -7, 1, -1]) == 4
  assert count_digits_sum([12, 23, 34, -45, -56, 0]) == 5
  assert count_digits_sum([-0, 1**0]) == 1
  assert count_digits_sum([1]) == 1
output: def count_digits_sum(arr):
      def sum_of_digits(n):
          return sum(int(d) if i == 0 else int(d) * (-1 if n < 0 else 1) for i, d in enumerate(str(abs(n))))
      
      return sum(1 for n in arr if sum_of_digits(n) > 0)