You will be given an array A of N non negative integers. Your task is to find the right most non zero digit in the product of array elements.
The first line of input contains a single integer T denoting the number of test cases.
Then T test cases follow. The first line of each test case consists of N, the size of the array. The second line of each test cases consists of N space separated non negative integers which denote the values in the array A.
Corresponding to each test case, in a new line, print the right most non zero digit in the product of the numbers. If there is no right most non zero digit, then print -1.
1 ≤ T ≤ 100
1 ≤ N ≤ 100
0 ≤ A[i] ≤ 1010
3 5 6 90909009
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.