{"raw_statement":[{"iden":"problem statement","content":"For a positive integer $X$, let $\\text{ctz}(X)$ be the (maximal) number of consecutive zeros at the **end** of the binary notation of $X$.  \nIf the binary notation of $X$ ends with a $1$, then $\\text{ctz}(X)=0$.\nYou are given a positive integer $N$. Print $\\text{ctz}(N)$."},{"iden":"constraints","content":"*   $1\\leq N\\leq 10^9$\n*   $N$ is an integer."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"2024"},{"iden":"sample output 1","content":"3\n\n$2024$ is `11111101000` in binary, with three consecutive `0`s from the end, so $\\text{ctz}(2024)=3$.  \nThus, print $3$."},{"iden":"sample input 2","content":"18"},{"iden":"sample output 2","content":"1\n\n$18$ is `10010` in binary, so $\\text{ctz}(18)=1$.  \nNote that we count the trailing zeros."},{"iden":"sample input 3","content":"5"},{"iden":"sample output 3","content":"0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}