For this Question: Given a natural number N, your task is to print all of its unique divisors in a sorted order.Input contains a single integer N.

Constraints:-
1 < = N < = 1000000000Print the unique divisors of N from smallest to largest.Sample Input:-
6

Sample Output:-
1 2 3 6

Sample Input:-
30

Sample Input:-
1 2 3 5 6 10 15 30, I have written this Solution Code: import math
n = int(input())
l=[]
for i in range(1,int(math.sqrt(n))+1):
	if (n%i==0):
		if(n//i==i):
			l.append(i)
		else:
			l.append(i)
			l.append(n//i)
l.sort()
print(*l), In this Programming Language: Python, Now tell me if this Code is compilable or not?