For this Question: Given an array A of size N (N is always even), you need to find exactly (N/2) numbers where each number represents the pair-wise product of consecutive elements of the array A.

In simple terms print (A[1]*A[2]), (A[3]*A[4]), ..., (A[N-1]*A[N]).


(Use long long int to avoid overflow)For each test case, the first line of the input contains an integer N (even number) denoting the number of elements in the array. The next line contains N (white-space separated) integers.

Constraints
1 <= N <= 10^2
1 <= A[i] <= 1000000000For each test case, output N/2 elements representing the pairwise product of adjacent elements in the array.Input-1
10
2 1 4 1 6 2 2 6 4 1 

Output-1
2 4 12 12 4

Input-2
8
1 23 54 2 3 6 43 2

Output-2
23 108 18 86

Explanation(might not be the optimal solution):
Testcase 1: 
Follow the below steps:-
Step 1: [2 1 4 1 6 2 2 6 4 1]
Step 2: (2 1), (4 1), (6 2), (2 6) and (4 1)
Step 3: 2 4 12 12 4, I have written this Solution Code: a=int(input())
b=list(map(int,input().split()))
for i in range(0,a-1,2):
	print(b[i]*b[i+1],end=" "), In this Programming Language: Python, Now tell me if this Code is compilable or not?