{"raw_statement":[{"iden":"problem statement","content":"You are given a non-negative integer $N$. Print all non-negative integers $x$ that satisfy the following condition in ascending order.\n\n*   The set of the digit positions containing $1$ in the binary representation of $x$ is a subset of the set of the digit positions containing $1$ in the binary representation of $N$.\n    *   That is, the following holds for every non-negative integer $k$: if the digit in the \"$2^k$s\" place of $x$ is $1$, the digit in the $2^k$s place of $N$ is $1$."},{"iden":"constraints","content":"*   $N$ is an integer.\n*   $0 \\le N < 2^{60}$\n*   In the binary representation of $N$, at most $15$ digit positions contain $1$."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"11"},{"iden":"sample output 1","content":"0\n1\n2\n3\n8\n9\n10\n11\n\nThe binary representation of $N = 11_{(10)}$ is $1011_{(2)}$.  \nThe non-negative integers $x$ that satisfy the condition are:\n\n*   $0000_{(2)}=0_{(10)}$\n*   $0001_{(2)}=1_{(10)}$\n*   $0010_{(2)}=2_{(10)}$\n*   $0011_{(2)}=3_{(10)}$\n*   $1000_{(2)}=8_{(10)}$\n*   $1001_{(2)}=9_{(10)}$\n*   $1010_{(2)}=10_{(10)}$\n*   $1011_{(2)}=11_{(10)}$"},{"iden":"sample input 2","content":"0"},{"iden":"sample output 2","content":"0"},{"iden":"sample input 3","content":"576461302059761664"},{"iden":"sample output 3","content":"0\n524288\n549755813888\n549756338176\n576460752303423488\n576460752303947776\n576461302059237376\n576461302059761664\n\nThe input may not fit into a $32$\\-bit signed integer."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}