{"problem":{"name":"Shift only","description":{"content":"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 b","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc081_b"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $1 \\leq N \\leq 200$\n*   $1 \\leq A_i \\leq 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ ... $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc081_b","tags":[],"sample_group":[["3\n8 12 40","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."],["4\n5 6 8 10","0\n\nSince there is an odd number $5$ on the blackboard already in the beginning, Snuke cannot perform the operation at all."],["6\n382253568 723152896 37802240 379425024 404894720 471526144","8"]],"created_at":"2026-03-03 11:01:13"}}