#35262: C++遞迴解
a0987659591@gmail.com
(李承恩)
#include<bits/stdc++.h>
#define ll long long //定義long long 為ll(單純後面比較方便而已XD)
using namespace std;
ll f(ll n){
if(n==1) return 1;
else return n+f(n-1);
}
ll g(ll n){
if(n==1) return 1;
else return f(n)+g(n-1);
}
signed main(){
ll n;
while(cin>>n){
cout<<f(n)<<" "<<g(n)<<endl;
}
}