For this Question: Given a pair product array pairProd[] containing positive integers of size K. Your task is to find the original array from given product array. A pair-product array for an array is the array that contains product of all pairs in ordered form.
For example: The product array for {a,b,c} will be {a*b, a*c, b*c}The input line contains T, denoting the number of testcases. Each testcase contains two lines. The first line contains K size of pair product array and second line contains elements of pair product array i.e. pairProd[i] separated by space.

Constraints:
1 <= T <= 100
3 <= K <= 10000
1 <= pairProd[i] <= 10000For each testcase print the original array separated by space in new line.Sample Input:
2
6
6 8 16 12 24 32
3
3 11 33

Sample Output:
2 3 4 8
1 3 11

Explanation:
Testcase 2: Elements of product array from the original array will be: 1*3, 1*11, 3*11., I have written this Solution Code: import math


		
def constructArr(pair, n) :
	size = int((1 + math.sqrt(1 + 8 * n)) // 2);
	arr = [0] * (size);
	arr[0] = int(math.sqrt((pair[0] * pair[1]) /pair[size - 1]));
	for i in range(1, size) :
		arr[i] = pair[i - 1] // arr[0];
	# printArr(arr, size);
	for i in range(size) :
		print(arr[i], end = " ");
	print()


test=int(input())
for i in range(test):
	n=int(input())
	pair=list(map(int,input().split()))
	constructArr(pair,n), In this Programming Language: Python, Now tell me if this Code is compilable or not?