For this Question: You are given an integer array of size N such that 0 <= A[i] <= 9. You need to form two numbers by concatenating these digits. All digits of given array must be used to form the two numbers. Find the minimum possible sum of two numbers that you found.

Note: Your number can contain leading zeroes but the sum cannot.First line contains an integer N - the size of array 
Next line contains N space separated integers denoting elements of array.

Constraints
1 <= N <= 10^5
0 <= Ai<= 9Print the minimum sum that you obtain.Sample Input 1:
6
6 8 4 5 2 3

Output 
604

Explanation:
The minimum sum is formed by numbers 358 and 246
 
Sample Input 2:
5
5 3 0 7 4

Output 
82

Explanation
The minimum sum is formed by numbers 35 and 047., I have written this Solution Code: a=int(input())

lis = list(map(int,input().split()))

lis.sort()

c,d=[],[]

for i in range(a):
    if(i%2==0):
        c.append(lis[i])
    else:
        d.append(lis[i])

cs=''
for i in range(len(c)):
    cs = cs+str(c[i])

ds=''
for i in range(len(d)):
    ds = ds+str(d[i])

print(int(ds)+int(cs)), In this Programming Language: Python, Now tell me if this Code is compilable or not?