#include <iostream>

using namespace std;

const int MOD = 1000000007;

int dv[1000];

int sqrt(int x) {
  int l = 1, r = x;
  while (l + 1 < r) {
    int m = (l + r) / 2;
    (m * m <= x ? l : r) = m;
  }
  return l;
}

void memoDivisor(int n) {
  while (n > 1) {
    for (int i = 2; i <= n; ++i) {
      if (n % i == 0) {
        dv[i]++;
        n /= i;
        break;
      }
    }
  }
}

int main() {
  int N;
  cin >> N;

  for (int i = 1; i <= N; ++i) memoDivisor(i);

  long long cnt = 1;
  for (int i = 2; i <= N; ++i) {
    cnt = cnt * (dv[i] + 1) % MOD;
  }

  cout << cnt << endl;
}

#include <bits/stdc++.h>
using namespace std;
int p[168], q[168], mod = 1000000007;
int primecheck(int n) {
    int d = 0;
    for (int i = 1; i <= sqrt(n); i++)
    {
        if (n % i == 0) d++;
        if (d == 2) break;
    }
    if (d > 1) return 0;
    else return 1;
}
int main() {
    int k = 0, n, l;
    long long f = 1;
    for (int i = 0; i < 168; i++) q[i] = 0;
    for (int i = 2; i <= 997; i++)
    {
        if (primecheck(i) == 1)
        {
            p[k] = i;
            k++;
        }
    }
    cin >> n;
    for (int i = 2; i <= n; i++)
    {
        k = 0, l = i;
        while (l != 1)
        {
            if (l % p[k] == 0)
            {
                l /= p[k];
                q[k]++;
            }
            else k++;
        }
    }
    for (int i = 0; i < 168; i++)
    {
        f *= (q[i] + 1);
        f %= mod;
    }
    cout << f;
}