human
What is a the Python program you requested given the following:
Solve in Python:
Given the head of a linked list, we repeatedly delete consecutive sequences of nodes that sum to 0 until there are no such sequences.
After doing so, return the head of the final linked list.  You may return any such answer.
 
(Note that in the examples below, all sequences are serializations of ListNode objects.)
Example 1:
Input: head = [1,2,-3,3,1]
Output: [3,1]
Note: The answer [1,2,1] would also be accepted.

Example 2:
Input: head = [1,2,3,-3,4]
Output: [1,2,4]

Example 3:
Input: head = [1,2,3,-3,-2]
Output: [1]

 
Constraints:

The given linked list will contain between 1 and 1000 nodes.
Each node in the linked list has -1000 <= node.val <= 1000.
assistant
#Here is the Python program you requested.

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def removeZeroSumSublists(self, head: ListNode) -> ListNode:
        
        array = []
        modified = False
        node = head
        #print(\"Head: \", head)
        while node:
            #print(\"node: \", node.val, modified, matched)
            next_node = node.__next__
            matched = False
            if node.val == 0:
                matched = True
                modified = True
                if len(array) > 0:
                    array[-1].next = next_node
                else:
                    head = next_node
            
            else:
                tsum = 0
                #print(\"For: \", node.val)
                for i in range(len(array) -1, -1, -1):
                    tsum += array[i].val
                    if tsum + node.val == 0:
                        matched = True
                        modified = True
                        #print(i)
                        if i != 0:
                            j = 0
                            popi = len(array) - i
                            while j != popi:
                                array.pop()
                                j += 1
                            array[i-1].next = next_node
                            #print(array[i-1].val, next_node.val, head)
                        else:
                            # all elements removed
                            head = next_node
                            array = []
                    # elif tsum + node.val > 0:
                    #     break
                        
            if not matched:
                array.append(node)
            node = next_node
        #print(\"op head: \", head)
        if modified:
            return self.removeZeroSumSublists(head)
        else:
            return head