import java.math.*;
import java.util.*;

public class Main {
    static int gcd(int a, int b) {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int l[] = new int[n];
        int GCD = 0;
        for (int i = 0; i < n; i++) {
            int tmp = sc.nextInt();
            if (i == 0){
                GCD = tmp;
                continue;
            }
            GCD = gcd(GCD, tmp);
        }
        int cnt = 0;
        while (GCD % 2 == 0) {
            GCD/=2;
            cnt++;
        }
        
        
        System.out.println(cnt);
    }
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz