Shift only

AtCoder

IDabc081_b

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

Input #1

3
8 12 40

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.

Input #2

4
5 6 8 10

Output #2

0

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

Input #3

6
382253568 723152896 37802240 379425024 404894720 471526144

Output #3

API Response (JSON)

{
  "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 b...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments