#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>

// using namespace __gnu_pbds;
using namespace std;

template <class X, class Y>
ostream &operator<<(ostream &os, pair<X, Y> const &p)
{
    return os << "(" << p.first << ", " << p.second << ") ";
}
template <class Ch, class Tr, class Container>
basic_ostream<Ch, Tr> &operator<<(basic_ostream<Ch, Tr> &os, Container const &x)
{
    os << "[ ";
    for (auto &y : x)
        os << y << ", ";
    return os << "]\n";
}
#define int long long
#define len(a) (int)a.size()
#define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
const long long INF = 1e18;
const double EPS = 1e-9;
const int di[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dj[8] = {0, 1, 0, -1, 1, 1, -1, -1};
// dp?, graph?, bs on answer?, compress/sort queries?, stupid observation?


int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int M = 1e9 + 7;
    int n;
    cin>>n;
    vector<int> spf(n+1);
    for (int i = 1; i <= n; i++)
        spf[i] = i;
    for (int i = 2; i <= n; i++)
    {
        if (spf[i] == i)
        {
            //primes.push_back(i);
            for (long long j = (long long)i * i; j <= n; j += i)
            {
                if (spf[j] == j)
                    spf[j] = i;
            }
        }
    }
    long long p = 1;
    for(int i=2;i<=n;i++){
        if(spf[i] == i) p= (p*i)%M;
    }
    cout<<p<<'\n';
    return 0;
}