#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

ll comb(ll n, ll r){
    if(r > n - r) r = n - r;
    ll fact = 1, ifact = 1;
    rep(i, 0, r){
        fact *= n-i;
        ifact *= i+1;
    }
    return fact/ifact;
}

int main()
{
    ll n;
    cin >> n;
    cout << comb(n+2, 2) << endl;
    return 0;
}