Problem:
Score : 200 points

Problem Statement

There are N positive integers written on a blackboard: A_1, ..., A_N.

Snuke can perform the following operation when all integers on the blackboard are even:

Replace each integer X on the blackboard by X divided by 2.

Find the maximum possible number of operations that Snuke can perform.

Constraints

1 \leq N \leq 200

1 \leq A_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the maximum possible number of operations that Snuke can perform.

Sample Input 1

3
8 12 40

Sample Output 1

2

Initially, [8, 12, 40] are written on the blackboard.
Since all those integers are even, Snuke can perform the operation.

After the operation is performed once, [4, 6, 20] are written on the blackboard.
Since all those integers are again even, he can perform the operation.

After the operation is performed twice, [2, 3, 10] are written on the blackboard.
Now, there is an odd number 3 on the blackboard, so he cannot perform the operation any more.

Thus, Snuke can perform the operation at most twice.

Sample Input 2

4
5 6 8 10

Sample Output 2

0

Since there is an odd number 5 on the blackboard already in the beginning, Snuke cannot perform the operation at all.

Sample Input 3

6
382253568 723152896 37802240 379425024 404894720 471526144

Sample Output 3

8

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

// https://qiita.com/drken/items/fd4e5e3630d0f5859067#%E7%AC%AC-3-%E5%95%8F--abc-081-b---shift-only-200-%E7%82%B9

#[warn(rust_2018_idioms)]
use std::io::{self, BufRead, BufWriter, Write};

// how many times can {A_1, .., A_N} be devided
// where 1 <= n <= 200, 1 <= A_i <= 200

fn main() {
    let mut buf = String::new();
    let handle = io::stdin();
    let mut handle = handle.lock();

    // N
    handle.read_line(&mut buf).unwrap();
    buf.pop();
    let n: isize = buf.parse().unwrap();
    buf.clear();

    // {x_i}_i
    handle.read_line(&mut buf).unwrap();
    let xs: Vec<isize> = {
        let mut iter = buf.split_whitespace();
        (0..n)
            .map(|_| iter.next().unwrap().parse().unwrap())
            .collect()
    };
    println!("{:?}", xs);

    let n_min_div: isize = xs
        .iter()
        .map(|&x: &isize| n_dividable_by_two(x))
        //.fold(0, |a, b| a + b);
        .min()
        .unwrap();

    print!("{}", n_min_div);
}

fn n_dividable_by_two(mut x: isize) -> isize {
    let mut count = 0;
    while x >= 2 && x % 2 == 0 {
        count += 1;
        x /= 2;
    }
    return count;
}