{"raw_statement":[{"iden":"problem statement","content":"You are given a sequence $A=(A_0,A_1,\\dots,A_{63})$ of length $64$ consisting of $0$ and $1$.\nFind $A_0 2^0 + A_1 2^1 + \\dots + A_{63} 2^{63}$."},{"iden":"constraints","content":"*   $A_i$ is $0$ or $1$."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$A_0$ $A_1$ $\\dots$ $A_{63}$"},{"iden":"sample input 1","content":"1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0"},{"iden":"sample output 1","content":"13\n\n$A_0 2^0 + A_1 2^1 + \\dots + A_{63} 2^{63} = 2^0 + 2^2 + 2^3 = 13$."},{"iden":"sample input 2","content":"1 0 1 0 1 0 0 0 0 1 0 0 1 1 0 1 1 1 1 0 0 0 1 0 0 1 1 1 1 1 1 0 0 0 0 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0"},{"iden":"sample output 2","content":"766067858140017173"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}