For this Question: Given an array of size N, find the index which partitions the arrays into 2 subarrays such that absolute difference of their sums is minimized.

If we partition with respect to index i (1<=i<=N) subarrays will be:-  (A1,A2,A3.....Ai-1) , (Ai+1,Ai+2,......An)First line of input contains the size of array N, next line contains N space separated integers depicting the values of array.

<b>Constraint</b>
1<=N<=10^5
1<=Arr[i]<=10^7
Print the index for minimum absolute difference. If more than one answer exists print the minimum index.Sample input:-
4
1 2 3 4 


Sample output:-
3

Explanation:-
For index 1 absolute difference = 2 + 3 + 4 = 9
For index 2 absolute difference = 3 + 4 - 1 = 6
For index 3 absolute difference = 4 - 1 - 2 = 1
For index 4 absolute difference = 1 + 2 + 3 = 6, I have written this Solution Code: import math 
n = int(input())
lst = list(map(int, input().strip().split()))

cuLstL = []
cuLstR = []

summ = 0
for i in range(len(lst)):
	summ += lst[i]
	cuLstL.append(summ)

summ = 0
for i in range(len(lst)-1, -1, -1):
	summ += lst[i]
	cuLstR.append(summ)
cuLstR = cuLstR[::-1]

l = []
for i in range(n):
	l.append(abs(cuLstL[i]-cuLstR[i]))
print(l.index(min(l))+1)
'''
for i in range(len(lst)): 		
	res = max(res, cuLst[i] - sink) 
	sink = min(sink, cuLst[i]) 
	print(res,sink)
print(res)
''', In this Programming Language: Python, Now tell me if this Code is compilable or not?