For this Question: There are N integers written on a black board. You can perform the following operation if and only if all the integers on the board are even.
Choose any one of the integers from the board. Let it be x. Replace x by x/2.
Find the maximum number of operations you can perform.The first line of the input contains a single integer N.
The second line of the input contains N space seperated integers.

Constraints:
1 <= N <= 10<sup>5</sup>
1 <= A<sub>i</sub> <= 10<sup>9</sup>Find the maximum number of operations you can perform.Sample Input:
3
8 12 40

Sample Output:
5, 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);
    for(auto &i : a) cin >> i;
    int ans = 0;
    for(int i = 0; i < n; i++){
        if(a[i] % 2){
            ans = 0;
            break;
        }
        a[i] /= 2;
        while(a[i] % 2 == 0){
            ans++;
            a[i] /= 2;
        }
    }
    cout << ans;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?