For this Question: You are given n integers a<sub>1</sub>, a<sub>2</sub>, …, a<sub>n</sub>. Find the maximum value of <b>max(a<sub>l</sub>, a<sub>l+1</sub>, …, a<sub>r</sub>) * min(a<sub>l</sub>, a<sub>l+1</sub>, …, a<sub>r</sub>)</b> over all pairs (l, r) of integers for which 1 &le; l < r &le; n.The first line of input contains a single integer n. The second line of each test case contains n integers a<sub>1</sub>, a<sub>2</sub>, …, a<sub>n</sub>

<b>Constraints</b>
2 &le; n &le; 10<sup>5</sup>
1 &le; a<sub>i</sub> &le; 10<sup>6</sup>Print a single integer denoting the maximum possible value of the product from the statement.<b>Sample Input 1</b>
3
2 4 3
<b>Sample Output 1</b>
12

<b>Sample Input 2</b>
4
3 2 3 1
<b>Sample Output 2</b>
6, I have written this Solution Code: #include <bits/stdc++.h>

using namespace std;
#define int long long
int32_t main()
{

    int t=1;
   // cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int a[n];
        int ans=0;
        for(int i=0;i<n;++i) {cin>>a[i];if(i!=0) ans=max(ans,a[i]*a[i-1]);}
        cout<<ans<<'\n';
    }
    return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?