input: Write a Python function that accepts an array of integers and returns the count of elements whose sum of digits is greater than zero. For negative numbers, the first digit retains its negative sign, for example, -123 has the signed digits -1, 2, and 3.
  assert count_elements([]) == 0
  assert count_elements([-1, -2, 0]) == 0
  assert count_elements([1, 1, 2, -2, 3, 4, 5]) == 6
  assert count_elements([1, 6, 9, -6, 0, 1, 5]) == 5
  assert count_elements([1, 100, 98, -7, 1, -1]) == 4
  assert count_elements([12, 23, 34, -45, -56, 0]) == 5
  assert count_elements([-0, 1**0]) == 1
  assert count_elements([1]) == 1
output: def count_elements(arr):
      def digit_sum(n):
          sum = 0
          if n < 0:
              sum = int(str(n)[1]) * -1
              digits = str(n)[2:]
          else:
              digits = str(n)
          
          for digit in digits:
              sum += int(digit)
          
          return sum
  
      return sum(1 for num in arr if digit_sum(num) > 0)