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: n = int(input())
arr = [int(x) for x in input().split()]
output = 1
mod = 1000000007
 
for i in range(n):
    output = (output*arr[i]) % mod
 
print(output), In this Programming Language: Python, Now tell me if this Code is compilable or not?