import java.util.Scanner;

public class Main{
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		int[] hoge =new int[N];

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


		//seisuuka?
		int[] hoge2 = new int[N];
		boolean b = true;
		int count = 0;
		while(b) {

			for(int i = 0; i<N; i++) {
				if((hoge[i]%2)!=0) {
					b = false;
					break;
				}
				hoge2[i] = hoge[i]/2;
				if (i==N-1) {
					hoge = hoge2;
					count = count +1;
				}


			}

		}
		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