 Magic numbers
Easy Accuracy: 24.46% Submissions: 1814 Points: 2

Given two function, one is h(x) which is the product of all the number in an array A[ ] having size N and another
function f(x) which denotes the GCD of all the numbers in an array. Your task is to find the value of  h(x)f(x).

Note: Since the answer can be very large, use modulo 109+7.

Example 1:

Input:
N = 2, A[] = {2, 4}
Output:
64
Explanation:
h(x) = 8, f(x) = 2, Therefore, the
answer is 82 = 64.

Example 2:

Input:
N = 3, A[] = {1, 3, 7}
Output:
21
Explanation:
h(x) = 21, f(x) = 1, Therefore, the


You don't need to read input or print anything. Your task is to complete the function getVal() which takes an Integer N and an array of integers A[] as input and returns the answer.

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)

Constraints:
1 <= N <= 105
1 <= A[i] <= 105

We are replacing the old Disqus forum with the new Discussions section given below.

### Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

#### My Submissions:  