#include<bits/stdc++.h>
#define int long long
#define I using
#define AK namespace
#define CSPS2025 std
//if atcoder
//#pragma GCC optimize(3)
I AK CSPS2025;
const int maxn=1e7+10,maxm=1e3+10,mod=1000000007,inf=10000000;
int n,m,u,v,w,x,y,z,res,ans,arr[]={0,682498929,491101308,76479948,723816384,67347853,27368307,625544428,199888908,888050723,927880474,281863274,661224977,623534362,970055531,261384175,195888993,66404266,547665832,109838563,933245637,724691727,368925948,268838846,136026497,112390913,135498044,217544623,419363534,500780548,668123525,128487469,30977140,522049725,309058615,386027524,189239124,148528617,940567523,917084264,429277690,996164327,358655417,568392357,780072518,462639908,275105629,909210595,99199382,703397904,733333339,97830135,608823837,256141983,141827977,696628828,637939935,811575797,848924691,131772368,724464507,272814771,326159309,456152084,903466878,92255682,769795511,373745190,606241871,825871994,957939114,435887178,852304035,663307737,375297772,217598709,624148346,671734977,624500515,748510389,203191898,423951674,629786193,672850561,814362881,823845496,116667533,256473217,627655552,245795606,586445753,172114298,193781724,778983779,83868974,315103615,965785236,492741665,377329025,847549272,698611116};
int solve(int x,int p)
{
    if(x>=mod)
    {
        return 0;
    }
    int ans=1;
    for(int i=2;i<=x;i++)
    {
        ans*=i;
        ans%=p;
    }
    return ans;
}
signed main()
{
    cin>>n;
    if(!n)
    {
        cout<<1;
        return 0;
    }
    if(n<=inf)
    {
        ans=(solve(n,mod))%mod;
        cout<<ans;
        return 0;
    } 
    else
    {
        u=n/inf;
        ans=arr[u];
        for(int i=u*inf+1;i<=n;i++)
        {
            ans*=i;
            ans%=mod;
        }
        cout<<ans;
    }
    return 0;
}