import java.util.Scanner;

public class Main {

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

    void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        // long K = sc.nextLong();
        int[] A = new int[N];
        boolean[] bool = new boolean[N];
        boolean res = true;
        for(int i=0; i<N; i++){
            A[i] = Integer.parseInt(sc.next());
            if(A[i] % 2 != 0){
                System.out.println(0);
                System.exit(0);
            }
        }
        int count = 0;
        boolean t = true;
        
        while(t){
            for(int i=0; i<N; i++){
                if(i == 0){
                    count += 1;
                }
                A[i] = A[i] / 2;
                if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                }
            } 
            if(!res){
                break;
            }
        }
        System.out.println(count);
        sc.close();
    }
}       import java.util.Scanner; Scanner java.util public class Main {

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

    void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        // long K = sc.nextLong();
        int[] A = new int[N];
        boolean[] bool = new boolean[N];
        boolean res = true;
        for(int i=0; i<N; i++){
            A[i] = Integer.parseInt(sc.next());
            if(A[i] % 2 != 0){
                System.out.println(0);
                System.exit(0);
            }
        }
        int count = 0;
        boolean t = true;
        
        while(t){
            for(int i=0; i<N; i++){
                if(i == 0){
                    count += 1;
                }
                A[i] = A[i] / 2;
                if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                }
            } 
            if(!res){
                break;
            }
        }
        System.out.println(count);
        sc.close();
    }
} Main public static void main(String[] args) {
        new Main().solve();
    } main {
        new Main().solve();
    } new Main().solve() new Main().solve new Main() String[] args args void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        // long K = sc.nextLong();
        int[] A = new int[N];
        boolean[] bool = new boolean[N];
        boolean res = true;
        for(int i=0; i<N; i++){
            A[i] = Integer.parseInt(sc.next());
            if(A[i] % 2 != 0){
                System.out.println(0);
                System.exit(0);
            }
        }
        int count = 0;
        boolean t = true;
        
        while(t){
            for(int i=0; i<N; i++){
                if(i == 0){
                    count += 1;
                }
                A[i] = A[i] / 2;
                if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                }
            } 
            if(!res){
                break;
            }
        }
        System.out.println(count);
        sc.close();
    } solve {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        // long K = sc.nextLong();
        int[] A = new int[N];
        boolean[] bool = new boolean[N];
        boolean res = true;
        for(int i=0; i<N; i++){
            A[i] = Integer.parseInt(sc.next());
            if(A[i] % 2 != 0){
                System.out.println(0);
                System.exit(0);
            }
        }
        int count = 0;
        boolean t = true;
        
        while(t){
            for(int i=0; i<N; i++){
                if(i == 0){
                    count += 1;
                }
                A[i] = A[i] / 2;
                if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                }
            } 
            if(!res){
                break;
            }
        }
        System.out.println(count);
        sc.close();
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int[] A = new int[N]; A new int[N] N boolean[] bool = new boolean[N]; bool new boolean[N] N boolean res = true; res true for(int i=0; i<N; i++){
            A[i] = Integer.parseInt(sc.next());
            if(A[i] % 2 != 0){
                System.out.println(0);
                System.exit(0);
            }
        } int i=0; int i=0; i 0 i<N i N i++ i++ i {
            A[i] = Integer.parseInt(sc.next());
            if(A[i] % 2 != 0){
                System.out.println(0);
                System.exit(0);
            }
        } {
            A[i] = Integer.parseInt(sc.next());
            if(A[i] % 2 != 0){
                System.out.println(0);
                System.exit(0);
            }
        } A[i] = Integer.parseInt(sc.next()) A[i] A i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc if(A[i] % 2 != 0){
                System.out.println(0);
                System.exit(0);
            } A[i] % 2 != 0 A[i] % 2 A[i] A i 2 0 {
                System.out.println(0);
                System.exit(0);
            } System.out.println(0) System.out.println System.out System System.out 0 System.exit(0) System.exit System 0 int count = 0; count 0 boolean t = true; t true while(t){
            for(int i=0; i<N; i++){
                if(i == 0){
                    count += 1;
                }
                A[i] = A[i] / 2;
                if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                }
            } 
            if(!res){
                break;
            }
        } t {
            for(int i=0; i<N; i++){
                if(i == 0){
                    count += 1;
                }
                A[i] = A[i] / 2;
                if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                }
            } 
            if(!res){
                break;
            }
        } for(int i=0; i<N; i++){
                if(i == 0){
                    count += 1;
                }
                A[i] = A[i] / 2;
                if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                }
            } int i=0; int i=0; i 0 i<N i N i++ i++ i {
                if(i == 0){
                    count += 1;
                }
                A[i] = A[i] / 2;
                if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                }
            } {
                if(i == 0){
                    count += 1;
                }
                A[i] = A[i] / 2;
                if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                }
            } if(i == 0){
                    count += 1;
                } i == 0 i 0 {
                    count += 1;
                } count += 1 count 1 A[i] = A[i] / 2 A[i] A i A[i] / 2 A[i] A i 2 if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                } A[i] % 2 != 0 A[i] % 2 A[i] A i 2 0 {
                    res = false;
                    break;
                } res = false res false break; if(!res){
                break;
            } !res res {
                break;
            } break; System.out.println(count) System.out.println System.out System System.out count sc.close() sc.close sc public class Main {

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

    void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        // long K = sc.nextLong();
        int[] A = new int[N];
        boolean[] bool = new boolean[N];
        boolean res = true;
        for(int i=0; i<N; i++){
            A[i] = Integer.parseInt(sc.next());
            if(A[i] % 2 != 0){
                System.out.println(0);
                System.exit(0);
            }
        }
        int count = 0;
        boolean t = true;
        
        while(t){
            for(int i=0; i<N; i++){
                if(i == 0){
                    count += 1;
                }
                A[i] = A[i] / 2;
                if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                }
            } 
            if(!res){
                break;
            }
        }
        System.out.println(count);
        sc.close();
    }
} public class Main {

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

    void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        // long K = sc.nextLong();
        int[] A = new int[N];
        boolean[] bool = new boolean[N];
        boolean res = true;
        for(int i=0; i<N; i++){
            A[i] = Integer.parseInt(sc.next());
            if(A[i] % 2 != 0){
                System.out.println(0);
                System.exit(0);
            }
        }
        int count = 0;
        boolean t = true;
        
        while(t){
            for(int i=0; i<N; i++){
                if(i == 0){
                    count += 1;
                }
                A[i] = A[i] / 2;
                if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                }
            } 
            if(!res){
                break;
            }
        }
        System.out.println(count);
        sc.close();
    }
} Main
import java.util.Scanner;

public class Main {

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

    void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        // long K = sc.nextLong();
        int[] A = new int[N];
        boolean[] bool = new boolean[N];
        boolean res = true;
        for(int i=0; i<N; i++){
            A[i] = Integer.parseInt(sc.next());
            if(A[i] % 2 != 0){
                System.out.println(0);
                System.exit(0);
            }
        }
        int count = 0;
        boolean t = true;
        
        while(t){
            for(int i=0; i<N; i++){
                if(i == 0){
                    count += 1;
                }
                A[i] = A[i] / 2;
                if(A[i] % 2 != 0 ){
                    res = false;
                    break;
                }
            } 
            if(!res){
                break;
            }
        }
        System.out.println(count);
        sc.close();
    }
}      