For this Question: Newton is given a sequence of N integers A<sub>1</sub>, A<sub>2</sub>, ... , A<sub>N</sub> 
He wants to calculate the inverse of the sum of the inverses of the numbers i.e. <sup>1</sup>&frasl;(<sub><sup>1</sup>&frasl;<sub>A<sub>1</sub></sub> + <sup>1</sup>&frasl;<sub>A<sub>2</sub></sub> +. . + <sup>1</sup>&frasl;<sub>A<sub>N</sub></sub>)</sub>
Help Newton with his unwanted curiosity and print the answer to the above equation.The first line of the input contains a single integer N
The next line contains N integers, A<sub>1</sub>, A<sub>2</sub>, ... , A<sub>N</sub>.

<b>Constraints:</b>
1) 1 &le; N &le; 100
2) 1 &le; A<sub>i</sub> &le; 100Output the answer, up to 8 decimal places.<b>Sample Input 1:</b>
2
10 30

<b>Sample Output 1:</b>
7.50000000

<b>Sample Input 2:</b>
3
200 200 200

<b>Sample Output 2:</b>
66.66666666666667

<b>Sample Explanation 1:</b>
1/(1/10 + 1/30) = 1/(4/30) = 30/4 = 7.5
, I have written this Solution Code: // LUOGU_RID: 97628102
#include<bits/stdc++.h>
using namespace std;

int main() {
    int n;
    double ans = 0;
    cin >> n;
    for(int i = 1; i <= n; i++){
        int a;
        cin >> a;
        ans += 1.0 / a;
    }
    cout << fixed << setprecision(8) << 1 / ans << endl;
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?