For this Question: Given an array X of size N containing positive integers, Newton is required to compute and output the product of all the numbers in the array modulo 10<sup>9</sup>+7.The first line contains a single integer N denoting the size of the array. 
The next line contains N space- separated integers denoting the elements of the array

<b>Constraints</b>
1 &le; N &le; 10<sup>3</sup>
1 &le; A<sub>[i]</sub> &le; 10<sup>3</sup>Print a single integer denoting the product of all the elements of the array Modulo 10<sup>9</sup>+7.Sample Input:
5
1 2 3 4 5

Sample output:
120

<b>Explanation</b>
There are 5 integers to multiply. Let's store the final answer in the output variable. Since 1 is the identity value for multiplication, initialize the output as 1.
output = 1
output = (output*1)%(10<sup>9</sup>+7)
output = (output*2)%(10<sup>9</sup>+7)
output = (output*3)%(10<sup>9</sup>+7)
output = (output*4)%(10<sup>9</sup>+7)
output = (output*5)%(10<sup>9</sup>+7), I have written this Solution Code: #include <iostream>
using namespace std;
 
int main() {
	int n,i;
	long long int p=1;
	cin >> n;
	int a[n];
	for(i=0;i<=n-1;i++)	
	{
		cin>>a[i];
		p=(p*a[i])%(1000000007);
 
	}
	cout<<p;
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?