import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] arr = new int[N];
        boolean flg = true;
        int count = 0;

        for(int i = 0; i < N; i++) {
            arr[i] = sc.nextInt();
        }

        while(flg) {
            boolean existOdd = false;
            for(int i = 0; i < N; i++) {
                if(arr[i] % 2 != 0){
                    flg = false;
                }
            }
            if(!flg) break;

            for(int j = 0; j < N; j++) {
                arr[j] = arr[j] / 2;
            }
            count++;
        }
        System.out.println(count);
    }
}

/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