# 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]))

IyB5b3VyIGNvZGUgZ29lcyBoZXJlCmRlZiBzb2x2ZShhcnIpOgoJbiA9IGxlbihhcnIpCglwcmVzdW0gPSBbMCBmb3IgaSBpbiByYW5nZShuKV0KCXByZXN1bVswXSA9IGFyclswXQoJZm9yIGkgaW4gcmFuZ2UoMSxuKToKCQlwcmVzdW1baV0gPSBwcmVzdW1baS0xXSArIGFycltpXQoJCglzdWZzdW0gPSBbMCBmb3IgaSBpbiByYW5nZShuKV0KCXN1ZnN1bVtuLTFdID0gYXJyW24tMV0KCWZvciBpIGluIHJhbmdlKG4tMiwtMSwtMSk6CgkJc3Vmc3VtW2ldID0gc3Vmc3VtW2krMV0gKyBhcnJbaV0KCQoJbWluaW5kZXggPSAwCgltaW5kaWZmID0gcHJlc3VtW24tMV0gIyMgbWF0aC5pbmYgCglmb3IgaSBpbiByYW5nZShuLTEpOgoJCWxlZnRhdmcgPSBwcmVzdW1baV0gLy8gKGkrMSkgCgkJcmlnaHRhdmcgPSBzdWZzdW1baSsxXSAvLyAobi1pLTEpCgkJY3VycmRpZmYgPSBhYnMobGVmdGF2ZyAtIHJpZ2h0YXZnKQoJCXByaW50KGksIGxlZnRhdmcsIHJpZ2h0YXZnLCBjdXJyZGlmZikKCQlpZiBjdXJyZGlmZiA8IG1pbmRpZmY6CgkJCW1pbmluZGV4ID0gaQoJCQltaW5kaWZmID0gY3VycmRpZmYKCQkKCXJldHVybiBtaW5pbmRleCsxCgpwcmludChzb2x2ZShbMiwxXSkp