import java.util.*;
// warm-up
public class Main {

	static void solve() {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt(), i = 0, t = 0;
		int[] a = new int[N];
		boolean ok = true;
		while (N-->0) {
			a[i++] = sc.nextInt();
			ok&=((a[i-1]&1)==0);
		}
		if (ok) {
			while (true) {
				for (i=0; i<a.length; i++) {
					ok&=((a[i]&1)==0);
					if (ok) a[i] = a[i]/2;
				}
				if (!ok) break;
				t++;
			}
		}
		System.out.println(t);
		sc.close();		
	}

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

}
/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