{"problem":{"name":"Trichotomy","description":{"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$: *   Operation: Cut the rope at two positions to obtain thr","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"relay_f"},"statements":[{"statement_type":"Markdown","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$.\n\n## Constraints\n\n*   $1 \\leq X \\leq 40$\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$X$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"relay_f","tags":[],"sample_group":[["2","14"]],"created_at":"2026-03-03 11:01:13"}}