{"raw_statement":[{"iden":"problem statement","content":"There are $N$ positive integers written on a blackboard: $A_1, ..., A_N$.\nSnuke can perform the following operation when all integers on the blackboard are even:\n\n*   Replace each integer $X$ on the blackboard by $X$ divided by $2$.\n\nFind the maximum possible number of operations that Snuke can perform."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 200$\n*   $1 \\leq A_i \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ ... $A_N$"},{"iden":"sample input 1","content":"3\n8 12 40"},{"iden":"sample output 1","content":"2\n\nInitially, $[8, 12, 40]$ are written on the blackboard. Since all those integers are even, Snuke can perform the operation.\nAfter 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.\nAfter 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.\nThus, Snuke can perform the operation at most twice."},{"iden":"sample input 2","content":"4\n5 6 8 10"},{"iden":"sample output 2","content":"0\n\nSince there is an odd number $5$ on the blackboard already in the beginning, Snuke cannot perform the operation at all."},{"iden":"sample input 3","content":"6\n382253568 723152896 37802240 379425024 404894720 471526144"},{"iden":"sample output 3","content":"8"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}