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);


	}

} import java.util.Scanner; Scanner java.util 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);


	}

} 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);


	} main {
		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);


	} Scanner scan = new Scanner(System.in); scan new Scanner(System.in) int N = scan.nextInt(); N scan.nextInt() scan.nextInt scan int[] hoge =new int[N]; hoge new int[N] N for (int i=0; i<N; i++) {
			hoge[i] = scan.nextInt();
		} int i=0; int i=0; i 0 i<N i N i++ i++ i {
			hoge[i] = scan.nextInt();
		} {
			hoge[i] = scan.nextInt();
		} hoge[i] = scan.nextInt() hoge[i] hoge i scan.nextInt() scan.nextInt scan int[] hoge2 = new int[N]; hoge2 new int[N] N boolean b = true; b true int count = 0; 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;
				}


			}

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


			}

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


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


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


			} if((hoge[i]%2)!=0) {
					b = false;
					break;
				} (hoge[i]%2)!=0 (hoge[i]%2) hoge[i] hoge i 2 0 {
					b = false;
					break;
				} b = false b false break; hoge2[i] = hoge[i]/2 hoge2[i] hoge2 i hoge[i]/2 hoge[i] hoge i 2 if (i==N-1) {
					hoge = hoge2;
					count = count +1;
				} i==N-1 i N-1 N 1 {
					hoge = hoge2;
					count = count +1;
				} hoge = hoge2 hoge hoge2 count = count +1 count count +1 count 1 System.out.println(count) System.out.println System.out System System.out count String[] args args 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);


	}

} 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);


	}

} Main
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);


	}

}
