#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(long (i)=1;(i)<(n+1);(i)++)
#define mod 998244353



int main(){
    int N;
    long long S;

    S = 2329089562801;
    cout << S << endl;

}
#include <iostream>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <cmath>
using namespace std;

#define mod 1000000007
#define ten5 100005
#define ten52 200015
#define ten53 300005
#define ten6 1000005
#define PI 3.1415926
#define pb(x) push_back(x)
#define all(x) x.begin(),x.end()
#define mkpr(x1,x2) make_pair(x1,x2)
typedef long long int ll;

ll num[ten52];

ll hcf(ll a,ll b)
{
    if(a==b || b==0) return a;
    if(a>b) return hcf(b,a%b);
    else return hcf(a,b%a);
}

int main(void)
{
    ll m=0,n,i=1,j=0,k=1,t=1,ans=2;
    cin>>n;
    for(i=3;i<=n;i++)
    {
        ans=ans*i/hcf(ans,i);
    }
    cout<<ans+1;
    return 0;
}
