{"raw_statement":[{"iden":"problem statement","content":"You are given a positive integer $N$. Find the number of the pairs of integers $u$ and $v$ $(0≦u,v≦N)$ such that there exist two non-negative integers $a$ and $b$ satisfying $a$ $xor$ $b=u$ and $a+b=v$. Here, $xor$ denotes the bitwise exclusive OR. Since it can be extremely large, compute the answer modulo $10^9+7$."},{"iden":"constraints","content":"*   $1≦N≦10^{18}$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"3"},{"iden":"sample output 1","content":"5\n\nThe five possible pairs of $u$ and $v$ are:\n\n*   $u=0,v=0$ (Let $a=0,b=0$, then $0$ $xor$ $0=0$, $0+0=0$.)\n    \n*   $u=0,v=2$ (Let $a=1,b=1$, then $1$ $xor$ $1=0$, $1+1=2$.）\n    \n*   $u=1,v=1$ (Let $a=1,b=0$, then $1$ $xor$ $0=1$, $1+0=1$.）\n    \n*   $u=2,v=2$ (Let $a=2,b=0$, then $2$ $xor$ $0=2$, $2+0=2$.）\n    \n*   $u=3,v=3$ (Let $a=3,b=0$, then $3$ $xor$ $0=3$, $3+0=3$.）"},{"iden":"sample input 2","content":"1422"},{"iden":"sample output 2","content":"52277"},{"iden":"sample input 3","content":"1000000000000000000"},{"iden":"sample output 3","content":"787014179"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}