For this Question: Given an array of length N in which you can swap two elements if their sum is odd i.e for every i (1 to N) and j (1 to N) if (Arr[i] + Arr[j]) is odd then you can swap these elements.
What is the lexicographically smallest array you can obtain?First line of input contains a single integer N. Next line contains N space separated integers depicting the elements of the array.

Constraints:-
1 <= N <= 100000
1 <= Arr[i] <= 100000Print N space separated elements i. e the array which is the lexicographically smallest possibleSample Input:-
3
4 1 7

Sample Output:-
1 4 7

Explanation:-
Swap numbers at indices 1 and 2 as their sum 4 + 1 = 5 is odd

Sample Input:-
2
2 4

Sample Output:-
2 4

Sample Input:-
2
5 3

Sample Output:-
5 3, I have written this Solution Code: n=int(input())
p=[int(x) for x in input().split()[:n]]
o=0;e=0
for i in range(n): 
    if (p[i] % 2 == 1): 
        o += 1; 
    else: 
        e += 1; 
if (o > 0 and e > 0): 
    p.sort(); 

for i in range(n): 
    print(p[i], end = " ");, In this Programming Language: Python, Now tell me if this Code is compilable or not?