#include<bits/stdc++.h>
using namespace std;
long long int total[1005],f[1005],m[1005];
void bee()
{
    f[0]=1;
    f[1]=1;
    m[0]=0;
    m[1]=1;
    total[0]=1;
    total[1]=2;
    int i;
    for(i=2;i<=1000;i++)
    {
        f[i]=f[i-1]+f[i-2];
        m[i]=f[i-1]+m[i-1];
        total[i]=m[i]+f[i];

    }
}
int main()
{
    bee();
    long long int n,i,j,k;
    while(1)
    {
        cin>>n;
        if(n<0)
            break;
        cout<<m[n]<<" "<<total[n]<<endl;
    }
    return 0;
}