# your code goes here
def solve(arr):
n = len(arr)
presum = [0 for i in range(n)]
presum[0] = arr[0]
for i in range(1,n):
presum[i] = presum[i-1] + arr[i]
sufsum = [0 for i in range(n)]
sufsum[n-1] = arr[n-1]
for i in range(n-2,-1,-1):
sufsum[i] = sufsum[i+1] + arr[i]
minindex = 0
mindiff = presum[n-1] ## math.inf
for i in range(n-1):
leftavg = presum[i] // (i+1)
rightavg = sufsum[i+1] // (n-i-1)
currdiff = abs(leftavg - rightavg)
print(i, leftavg, rightavg, currdiff)
if currdiff < mindiff:
minindex = i
mindiff = currdiff
return minindex+1
print(solve([2,1]))