#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <cmath>  
#include <string>  
#include <algorithm>  
#include <vector>  
#include <map>  
using namespace std;  
const int N = 1e5+10;  
typedef long long LL;  
const LL mod = 1e9+7;  
int a[N];  
  
int main()  
{  
    int n;  
    while(scanf("%d", &n)!=EOF)  
    {  
        for(int i=2;i<=n;i++)  
        {  
            int x=i;  
            for(int j=2;j<=x;j++)  
            {  
                while(x%j==0)  
                {  
                    a[j]++;  
                    x/=j;  
                }  
            }  
            if(x!=1) a[x]++;  
        }  
        LL ans=1;  
        for(int i=1;i<=n;i++)  
        {  
            if(a[i]!=0) ans=(ans*(a[i]+1))%mod;  
        }  
        printf("%lld\n",ans);  
    }  
    return 0;  
}