For this Question: Given an array arr[] of N integers arranged in a circular fashion. Your task is to find the maximum contiguous subarray sum containing at least 1 element.The first line of input contains a single integer T which denotes the number of test cases. The first line of each test case contains a single integer N which denotes the total number of elements. The second line of each test case contains N space-separated integers denoting the elements of the array.

<b>Constraints:</b>
1 <= T <= 100
1 <= N <= 10^5
-10^6 <= Arr[i] <= 10^6

The Sum of N over all test cases is less than equal to 10^6.For each test case print the maximum sum obtained by adding the consecutive elements.<b>Input:</b>
4
7
8 -8 9 -9 10 -11 12
8
10 -3 -4 7 6 5 -4 -1
8
-1 40 -14 7 6 5 -4 -1
4
-1 -2 -3 -4

<b>Output:</b>
22
23
52
-1

Explanation:
Testcase 1: Starting from the last element of the array, i.e, 12, and moving in a circular fashion, we have max subarray as 12, 8, -8, 9, -9, 10, which gives the maximum sum as 22., I have written this Solution Code: def kadane(a):
	Max = a[0]
	temp = Max
	for i in range(1,len(a)):
		temp += a[i]
		if temp < a[i]:
			temp = a[i]
		Max = max(Max,temp)
	return Max

def maxCircularSum(a):
	n = len(a)
	max_kadane = kadane(a)
	neg_a = [-1*x for x in a]
	max_neg_kadane = kadane(neg_a)
	max_wrap = -(sum(neg_a)-max_neg_kadane)
	res = max(max_wrap,max_kadane)
	return res if res != 0 else max_kadane

for _ in range(int(input())):
    s=int(input())
    a=list(map(int,input().split()))
    print(maxCircularSum(a)), In this Programming Language: Python, Now tell me if this Code is compilable or not?