#include <stdio.h>
#include <iostream>
#include <string>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <map>
#include <vector>
#include <set>
#include <queue>
using namespace std;

int n, i, j;
long long mod = (long long)pow(10.0,18);
long long a[201][3] = {0};

int main() {
    a[1][0] = 1; a[0][0] = 1;
    for (i = 2; i <= 200; ++i) {
        a[i][0] = a[i-1][0] + a[i-2][0];
        a[i][1] = a[i-1][1] + a[i-2][1] + a[i][0]/mod; a[i][0] %= mod;
        a[i][2] = a[i-1][2] + a[i-2][2] + a[i][1]/mod; a[i][1] %= mod;
    }
    while (scanf("%d", &n) != EOF) {
        j = 0;
        if (a[n][2] != 0) { printf("%I64d", a[n][2]); j = 1; }

        if (j > 0) printf("%018I64d", a[n][1]);
        else if (a[n][1] > 0) { printf("%I64d", a[n][1]); j = 1; }

        if (j > 0) printf("%018I64d\n", a[n][0]);
        else printf("%I64d\n", a[n][0]);
    }
}