#include <bits/stdc++.h>

using namespace std;

// 原题目： https://blog.csdn.net/weixin_45485719/article/details/103219960
int dp(int n) {
    if (n == 2) return 2;
    if (n == 3) return 3;
    return dp(n - 1) + dp(n - 2);
}
const int N = 110;
int f[N];
int main() {
    int n;
    scanf("%d", &n);
    //递归
    printf("%d\n", dp(n));
    //递推
    f[2] = 2, f[3] = 3;
    for (int i = 4; i <= n; i++) f[i] = f[i - 1] + f[i - 2];
    printf("%d\n", f[n]);
    return 0;
}