{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\u0027$\u0027,\u0027$\u0027]] } }); \u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027 src\u003d\u0027https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\u0027\u003e\u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027\u003esetTimeout(function(){MathJax.Hub.Queue([\u0027Typeset\u0027, MathJax.Hub, \u0027left_view\u0027]);}, 2000);\u003c/script\u003e\n\u003cdiv class\u003d\"panel_content\"\u003e\n 我们再来玩一个汉诺塔的游戏,普通汉诺塔游戏的条件是一次只能移动一个盘,且不允许大盘放在小盘的上面。 \n \u003cbr\u003e 但现在改变游戏的玩法,不允许直接从最左(右)边移到最右(左)边(每次移动一定是移到中间杆上或从中间移出来),也不允许大盘放到下盘的上面。 \n \u003cbr\u003e wwh已经做过原来的汉诺塔问题,但碰到这个问题时,他想了很久,现在请你帮助他。现在有N个圆盘,他至少多少次移动才能把这些圆盘从最左边移到最右边? \n \u003cbr\u003e \n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"包含多组数据,每次输入一个N值(1\u0026lt;\u003dN\u003d35)。"}},{"title":"Output","value":{"format":"HTML","content":"对于每组数据,输出移动最小的次数。"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e1\n3\n12\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e2\n26\n531440\u003c/pre\u003e"}}]}