import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner kb = new Scanner(System.in);
		int n = kb.nextInt();
		
		int[]numA = new int[n];
		
		boolean exist_odd = false;
		
		for(int i=0; i< n; i++) {
			numA[i] = kb.nextInt();
			if(numA[i]%2 == 1)
				exist_odd = true;
		}
		if(exist_odd == true) 
			System.out.println(0);
		else {
			int min = Integer.MAX_VALUE;
			for(int i=0; i< n; i++) {
				int ans = 0;
				while(numA[i] %2 == 0) { 
					numA[i] /= 2;
					ans++;
				}
				min = Math.min(min, ans);
			}
			System.out.println(min);
		}
		kb.close();
	}
}
/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