import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Scanner;

class Main {
    static final int MOD = 1000000007;
    static final int INF = 1 << 30;
    static final int ALF = 26;

    Main() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int min = 100;
        for (int i = 0; i < N; i++) {
            int num = sc.nextInt();
            int k = 0;
            while( (1 & num) == 0){
                num>>=1;
                k++;
            }
            min = Math.min(min, k);
        }

        System.out.println(min);
    }

    public static void main(String[] args) {
        new Main();
    }
} import java.math.BigInteger; BigInteger java.math import java.util.ArrayList; ArrayList java.util import java.util.Arrays; Arrays java.util import java.util.Collections; Collections java.util import java.util.Comparator; Comparator java.util import java.util.HashMap; HashMap java.util import java.util.HashSet; HashSet java.util import java.util.Iterator; Iterator java.util import java.util.List; List java.util import java.util.Map; Map java.util import java.util.Map.Entry; Entry java.util.Map import java.util.PriorityQueue; PriorityQueue java.util import java.util.Scanner; Scanner java.util class Main {
    static final int MOD = 1000000007;
    static final int INF = 1 << 30;
    static final int ALF = 26;

    Main() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int min = 100;
        for (int i = 0; i < N; i++) {
            int num = sc.nextInt();
            int k = 0;
            while( (1 & num) == 0){
                num>>=1;
                k++;
            }
            min = Math.min(min, k);
        }

        System.out.println(min);
    }

    public static void main(String[] args) {
        new Main();
    }
} Main static final int MOD = 1000000007; MOD 1000000007 static final int INF = 1 << 30; INF 1 << 30 1 30 static final int ALF = 26; ALF 26 Main() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int min = 100;
        for (int i = 0; i < N; i++) {
            int num = sc.nextInt();
            int k = 0;
            while( (1 & num) == 0){
                num>>=1;
                k++;
            }
            min = Math.min(min, k);
        }

        System.out.println(min);
    } Main {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int min = 100;
        for (int i = 0; i < N; i++) {
            int num = sc.nextInt();
            int k = 0;
            while( (1 & num) == 0){
                num>>=1;
                k++;
            }
            min = Math.min(min, k);
        }

        System.out.println(min);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int min = 100; min 100 for (int i = 0; i < N; i++) {
            int num = sc.nextInt();
            int k = 0;
            while( (1 & num) == 0){
                num>>=1;
                k++;
            }
            min = Math.min(min, k);
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            int num = sc.nextInt();
            int k = 0;
            while( (1 & num) == 0){
                num>>=1;
                k++;
            }
            min = Math.min(min, k);
        } {
            int num = sc.nextInt();
            int k = 0;
            while( (1 & num) == 0){
                num>>=1;
                k++;
            }
            min = Math.min(min, k);
        } int num = sc.nextInt(); num sc.nextInt() sc.nextInt sc int k = 0; k 0 while( (1 & num) == 0){
                num>>=1;
                k++;
            } (1 & num) == 0 (1 & num) 1 num 0 {
                num>>=1;
                k++;
            } num>>=1 num 1 k++ k min = Math.min(min, k) min Math.min(min, k) Math.min Math min k System.out.println(min) System.out.println System.out System System.out min public static void main(String[] args) {
        new Main();
    } main {
        new Main();
    } new Main() String[] args args
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Scanner;

class Main {
    static final int MOD = 1000000007;
    static final int INF = 1 << 30;
    static final int ALF = 26;

    Main() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int min = 100;
        for (int i = 0; i < N; i++) {
            int num = sc.nextInt();
            int k = 0;
            while( (1 & num) == 0){
                num>>=1;
                k++;
            }
            min = Math.min(min, k);
        }

        System.out.println(min);
    }

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