For this Question: There are N positive integers written on a blackboard: A<sub>1</sub>,. , A<sub>N</sub>.
Edward can perform the following operation when all integers on the blackboard are even:

Replace each integer X on the blackboard by X divided by 2.
Find the maximum possible number of operations that Edward can perform.The input consists of an integer N and N space separated integers.
N
A<sub>1</sub> A<sub>2</sub>. . A<sub>N</sub>

<b>Constraints</b>
1&le;N&le;200
1&le;A<sub>i</sub>&le;10^9Print the maximum possible number of operations that Edward can perform.<b>Sample Input 1</b> 
3
8 12 40
<b>Sample Output 1</b> 
2

<b>Sample Input 2</b> 
4
5 6 8 10
<b>Sample Output 2</b> 
0, I have written this Solution Code: #include <iostream>
using namespace std;
 
int main() {
  int N;
  cin >> N;
 
  int minCnt = 1000000000;
  for (int i = 0; i < N; i++) {
    int A;
    cin >> A;
 
    int cnt = 0;
    while (A % 2 == 0) {
      cnt++;
      A /= 2;
    }
 
    if (cnt < minCnt) {
      minCnt = cnt;
    }
  }
 
  cout << minCnt << endl;
 
  return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?