#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; ++i)
using C = complex<double>;
const ll md = 1000000007;

int main(){
  int n;
  cin >> n;
  cout << n - 1 << endl;
  return 0;
}
#include <bits/stdc++.h>
#define rep(i, N) for(int i = 0; i < (int)N; i++)
#define rep1(i, N) for(int i = 1; i <= (int)N; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
  
   
int main() {
    ll n;
    scanf("%lld", &n);
  
    vector<ll> a;
    for(ll i=2;i<=n;i++){
        a.emplace_back(i);
    }
    rep(i,(int)a.size()-1) rep(j,(int)a.size()-1){
        a[j] = a[j]/__gcd(a[j],a[j+1])*a[j+1];
    }
  
    
    printf("%lld\n", a[0]+1);
}