#include <bits/stdc++.h>

using namespace std;
const int N = 210;
long long a[N];

long long fib(int n) {
    if (n == 1) return 1;
    if (n == 2) return 1;
    if (a[n]) return a[n];
    return a[n] = fib(n - 1) + fib(n - 2);
}

int main() {
    printf("%lld", fib(100));
    return 0;
}