By taorunz

// luogu-judger-enable-o2

#include<cstdio>

#include<algorithm>

#define LL long long

using namespace std;

const int MAXN = 1e7 + , mod = 1e9 + ;

int N;

LL ans = ;

int prime[MAXN], tot, vis[MAXN], phi[MAXN];

void GetPhi(int N) {

    phi[] = ;

    for(int i = ; i <= N; i++) {

        if(!vis[i]) prime[++tot] = i, phi[i] = i - ;

        for(int j = ; j <= tot && i * prime[j] <= N; j++) {

            vis[i * prime[j]] = ;

            if(i % prime[j] == ) phi[i * prime[j]] = phi[i] * prime[j];

            else phi[i * prime[j]] = phi[i] * phi[prime[j]];

        }

    }

}

int main() {

    scanf("%d", &N);

    GetPhi(1e6 + );

    for(int i = ; i <= N; i++) ans = (1ll * ans * phi[i]) % mod;

    printf("%lld", ans);

    return ;

}

/*

123 321

*/