Break Number

AtCoder

IDabc068_b

Time2000ms

Memory256MB

Difficulty—

Takahashi loves numbers divisible by $2$. You are given a positive integer $N$. Among the integers between $1$ and $N$ (inclusive), find the one that can be divisible by $2$ for the most number of times. The solution is always unique. Here, the number of times an integer can be divisible by $2$, is how many times the integer can be divided by $2$ without remainder. For example, * $6$ can be divided by $2$ once: $6$ -> $3$. * $8$ can be divided by $2$ three times: $8$ -> $4$ -> $2$ -> $1$. * $3$ can be divided by $2$ zero times. ## Constraints * $1 ≤ N ≤ 100$ ## Input Input is given from Standard Input in the following format: $N$ [samples]

Samples

Input #1

Output #1

4

$4$ can be divided by $2$ twice, which is the most number of times among $1$, $2$, ..., $7$.

Input #2

Output #2

Input #3

Output #3

Input #4

Output #4

API Response (JSON)

{
  "problem": {
    "name": "Break Number",
    "description": {
      "content": "Takahashi loves numbers divisible by $2$. You are given a positive integer $N$. Among the integers between $1$ and $N$ (inclusive), find the one that can be divisible by $2$ for the most number of tim",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc068_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Takahashi loves numbers divisible by $2$.\nYou are given a positive integer $N$. Among the integers between $1$ and $N$ (inclusive), find the one that can be divisible by $2$ for the most number of tim...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments