sgu 130 Circle

#pragma comment(linker,"/STACK:1024000000,1024000000")
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <cassert>
#include <list>
#define mkp make_pair 
using namespace std;
const double EPS=1e-8;
const int SZ=33,INF=0x7FFFFFFF;
const long long mod=19999997;
typedef long long lon;
lon arr[SZ];

void init()
{
    arr[1]=1;
    for(lon i=2;i<SZ;++i)arr[i]=arr[i-1]*(4*i-2)/(i+1);
}

int main()
{
    std::ios::sync_with_stdio(0);
    //freopen("d:\\1.txt","r",stdin);
    lon casenum;
    //cin>>casenum;
    //scanf("%d",&casenum);
    //for(lon time=1;time<=casenum;++time)
    //for(lon time=1;cin>>n;++time)
    {
        init();
        lon n;
        cin>>n;
        cout<<arr[n]<<" "<<n+1<<endl;
    }
    return 0;
}