#include <iostream> #include <vector> using namespace std; int fibonacci_no_rec(int n) { if (n <= 0) { return 0; } else if (n == 1) { return 1; } else { vector<int> fib(n + 1); fib[0] = 0; fib[1] = 1; for (int i = 2; i <= n; ++i) { fib[i] = fib[i - 1] + fib[i - 2]; } return fib[n]; } } int main() { int n; cin >> n; int result = fibonacci_no_rec(n); cout << result << endl; return 0; }