// package other2017.codefestival2017.quala;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Main {
    static final int INF = 100000000;

    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);

        int n = in.nextInt();
        int[] a = new int[n];

        int[] levelA = new int[n];
        int[] levelB = new int[n];
        for (int i = 0; i < n ; i++) {
            a[i] = in.nextInt();

            int ai = a[i];
            int k = 0;
            while (ai >= 2) {
                ai /= 2;
                k++;
            }

            levelA[i] = k;
            if (a[i] == (1<<k)) {
                levelB[i] = k;
            } else {
                levelB[i] = k+1;
            }
        }

        int[][] dp = new int[n+1][2];
        for (int i = 0; i <= n; i++) {
            Arrays.fill(dp[i], INF);
        }
        dp[0][0] = 0;
        for (int i = 0; i < n ; i++) {
            for (int j = 0; j <= 1 ; j++) {
                int base = dp[i][j];
                if (base >= INF) {
                    continue;
                }
                int last = (i == 0) ? 0 : ((j == 0) ? levelA[i-1] : levelB[i-1]);
                for (int t = 0 ; t <= 1 ; t++) {
                    int from = t == 0 ? levelB[i] : levelA[i];
                    int to = t == 0 ? levelA[i] : levelB[i];
                    int tocost = base + Math.abs(last-from) + Math.abs(from-to);
                    if (i+1 == n) {
                        tocost += to;
                    }
                    dp[i+1][t] = Math.min(dp[i+1][t], tocost);
                }
            }
        }

        out.println(Math.min(dp[n][0], dp[n][1]) / 2);
        out.flush();
    }

    public static void debug(Object... o) {
        System.err.println(Arrays.deepToString(o));
    }

    public static class InputReader {
        private static final int BUFFER_LENGTH = 1 << 12;
        private InputStream stream;
        private byte[] buf = new byte[BUFFER_LENGTH];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        private int next() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public char nextChar() {
            return (char) skipWhileSpace();
        }

        public String nextToken() {
            int c = skipWhileSpace();
            StringBuilder res = new StringBuilder();
            do {
                res.append((char) c);
                c = next();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public int nextInt() {
            return (int) nextLong();
        }

        public long nextLong() {
            int c = skipWhileSpace();
            long sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = next();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = next();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public double nextDouble() {
            return Double.valueOf(nextToken());
        }

        int skipWhileSpace() {
            int c = next();
            while (isSpaceChar(c)) {
                c = next();
            }
            return c;
        }

        boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
    }
}

Measured memory_bytes: 29384