For this Question: You are given an array A of size N. Find if there is any subarray in the array whose GCD is equal to 1.The first line of the input contains a single integer N.
The second line contains N space seperated integers.

Constraints:
1 <= N <= 10<sup>5</sup>
1 <= A<sub>i</sub> <= 10<sup>9Print "YES" if there is any subarray in the array whose GCD is equal to 1, else print "NO", without the quotes.Sample Input:
5
6 2 5 3 1

Sample Output:
YES, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
    int n;
    cin >> n;
    vector<int> a(n);
    map<int, int> mp;
    for(auto &i : a) cin >> i;
    int g = a[0];
    for(int i = 1; i < n; i++){
        g = __gcd(g, a[i]);
    }
    cout << (g > 1 ? "NO" : "YES");
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?