human
Give me a the Python program you requested given the following:
I found an interesting problem on https://leetcode.com/problems/split-array-with-same-average/:
In a given integer array A, we must move every element of A to either list B or list C. (B and C initially start empty.)
Return true if and only if after such a move, it is possible that the average value of B is equal to the average value of C, and B and C are both non-empty.
Example :
Input: 
[1,2,3,4,5,6,7,8]
Output: true
Explanation: We can split the array into [1,4,5,8] and [2,3,6,7], and both of them have the average of 4.5.

Note:

The length of A will be in the range [1, 30].
A[i] will be in the range of [0, 10000].

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python program you requested.

from fractions import Fraction
class Solution:
    def splitArraySameAverage(self, A: List[int]) -> bool:
        if len(A) == 1: return False
        avg = Fraction(sum(A), len(A))
        A = [num - avg for num in A]
        left = set()
        for i in range(len(A) // 2):
            curr_set = {s + A[i] for s in left}
            left = left | curr_set | {A[i]}
        if 0 in left: return True
        rsum = sum(A[i] for i in range(len(A) // 2, len(A)))
        right = set()
        for i in range(len(A) // 2, len(A)):
            if A[i] == 0: return True
            curr_set = {A[i]}
            for s in right:
                if s + A[i] == 0 or (- s - A[i] in left and s + A[i] != rsum):
                    return True
                curr_set.add(s + A[i])
            right = right | curr_set
        return False