{"raw_statement":[{"iden":"problem statement","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 times. The solution is always unique.\nHere, the number of times an integer can be divisible by $2$, is how many times the integer can be divided by $2$ without remainder.\nFor example,\n\n*   $6$ can be divided by $2$ once: $6$ -> $3$.\n*   $8$ can be divided by $2$ three times: $8$ -> $4$ -> $2$ -> $1$.\n*   $3$ can be divided by $2$ zero times."},{"iden":"constraints","content":"*   $1 ≤ N ≤ 100$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"7"},{"iden":"sample output 1","content":"4\n\n$4$ can be divided by $2$ twice, which is the most number of times among $1$, $2$, ..., $7$."},{"iden":"sample input 2","content":"32"},{"iden":"sample output 2","content":"32"},{"iden":"sample input 3","content":"1"},{"iden":"sample output 3","content":"1"},{"iden":"sample input 4","content":"100"},{"iden":"sample output 4","content":"64"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}