{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003ch1\u003e\u003c/h1\u003e\n\n\u003cp\u003e\n Write 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:\n\u003c/p\u003e\n\n\\begin{equation*}\nfib(n)\u003d \\left \\{\n\\begin{array}{ll}\n1 \u0026amp; (n \u003d 0) \\\\\n1 \u0026amp; (n \u003d 1) \\\\\nfib(n - 1) + fib(n - 2) \u0026amp; \\\\\n\\end{array}\n\\right.\n\\end{equation*}\n\n\u003ch2\u003eInput\u003c/h2\u003e\n\n\u003cp\u003e\n An integer $n$ is given.\n\u003c/p\u003e\n\n\u003ch2\u003eoutput\u003c/h2\u003e\n\n\u003cp\u003e\n Print the $n$-th fibonacci number in a line.\n\u003c/p\u003e\n\n\u003ch2\u003eConstraints\u003c/h2\u003e\n\n\u003cul\u003e\n\u003cli\u003e$0 \\leq n \\leq 44$\u003c/li\u003e\n\u003c/ul\u003e\n\n\n\u003ch2\u003eSample Input 1\u003c/h2\u003e\n\u003cpre\u003e3\n\u003c/pre\u003e\n\n\u003ch2\u003eSample Output 1\u003c/h2\u003e\n\u003cpre\u003e3\n\u003c/pre\u003e"}}]}