For this Question: The flower shop near his house sells flowers of N types. It is found that the store has Ai flowers of the i-th type. We like odd numbers. Therefore, we have decided that there should be an odd number of flowers of each type in the bouquet, and the total number of flowers in the bouquet should also be odd.
Determine the maximum number of flowers the bouquet can consist of.The first line contains an integer N — the number of types of flowers that are sold in the store
The second line contains N integers— the number of flowers of each type

1 <= N <= 100000
1 <= Ai <= 1000Print one number — the maximum number of flowers the bouquet can consist of.Sample input
3
3 5 8

Sample output
15

Sample input
3
1 1 1

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

int main(){
    int n; cin >> n ;
    long long int ans = 0;
    // int arr[n];
    int odd = 0,minn=INT_MAX;
    for(int i=0;i<n;i++){
        ll temp; cin >> temp;
        // cin >> arr[i];
        ans += (temp&1) ? temp : temp-1;
        if(minn>temp)
            minn = temp; 
    }
    if(n&1)
        cout << ans ;
    else{
        if(minn&1)
            cout <<ans-minn;
        else
            cout << ans - minn + 1;
    }
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?