{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"\u003chtml\u003e\n \u003chead\u003e\n \u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\u003c/script\u003e\n \u003cscript language\u003d\"JavaScript\" type\u003d\"text/javascript\" src\u003d\"http://cdn.mathjax.org/mathjax/latest/MathJax.js?config\u003dTeX-AMS_HTML\"\u003e\n\u003c/script\u003e\n \u003c/head\u003e\n \u003cbody\u003e\n \u003ch1\u003e\u003c/h1\u003e\n \u003cp\u003eWrite a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:\u003c/p\u003e \\begin{equation*} fib(n)\u003d \\left \\{ \\begin{array}{ll} 1 \u0026amp; (n \u003d 0) \\\\ 1 \u0026amp; (n \u003d 1) \\\\ fib(n - 1) + fib(n - 2) \u0026amp; \\\\ \\end{array} \\right. \\end{equation*} \n \u003ch2\u003eInput\u003c/h2\u003e\n \u003cp\u003eAn integer $n$ is given.\u003c/p\u003e\n \u003ch2\u003eoutput\u003c/h2\u003e\n \u003cp\u003ePrint the $n$-th fibonacci number in a line.\u003c/p\u003e\n \u003ch2\u003eConstraints\u003c/h2\u003e\n \u003cul\u003e\n \u003cli\u003e$0 \\leq n \\leq 44$\u003c/li\u003e\n \u003c/ul\u003e\n \u003ch2\u003eSample Input 1\u003c/h2\u003e\n \u003cpre\u003e3\n\u003c/pre\u003e\n \u003ch2\u003eSample Output 1\u003c/h2\u003e\n \u003cpre\u003e3\n\u003c/pre\u003e\n \u003c/body\u003e\n\u003c/html\u003e"}}]}