import java.util.Scanner;

public class Main {
    static int N;
    static int[] a;

    private static void init() {
        Scanner scanner = new Scanner(System.in);
        N = scanner.nextInt();
        a = new int[N];
        for(int i = 0; i < N; i++) a[i] = scanner.nextInt();

        scanner.close();
    }

    private static boolean check() {

        boolean ok = true;
        for(int i = 0; i < N; i++) {
            if(a[i] % 2 != 0) {
                ok = false;
                break;
            }
        }
        return ok;
    }


    public static void main(String args[]) {
        init();

        int count = 0;
        while (true) {
            if(check()) {
                count++;
                for(int j = 0; j < N; j++) {
                    a[j] = a[j] / 2;
                }
            } else {
                break;
            }
        }

        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