{"raw_statement":[{"iden":"problem statement","content":"We have a cord whose length is a positive integer. We will perform the following condition until the length of the cord becomes at most $2$:\n\n*   Operation: Cut the rope at two positions to obtain three cords, each with a length of a positive integer. Among these, discard one with the longest length and one with the shortest length, and keep the remaining one.\n\nLet $f(N)$ be the maximum possible number of times to perform this operation, starting with a cord with the length $N$.\nYou are given a positive integer $X$. Find the maximum integer $N$ such that $f(N)=X$."},{"iden":"constraints","content":"*   $1 \\leq X \\leq 40$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$X$"},{"iden":"sample input 1","content":"2"},{"iden":"sample output 1","content":"14"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}