You are given an integer N. Find the number of the positive divisors of N!, modulo 10^9+7.

Constraints

* 1≤N≤10^3

Input

The input is given from Standard Input in the following format:


N


Output

Print the number of the positive divisors of N!, modulo 10^9+7.

Examples

Input

3


Output

4


Input

6


Output

30


Input

1000


Output

972926972
import java.util.*;
import java.io.*;

class EratosSieve {
	private int sieve[];
	private Set<Integer> primeSet = new HashSet<>();

	EratosSieve(int x) {
		//篩の作成
		sieve = new int[x + 1];
		sieve[0] = sieve[1] = -1;
		for (int i = 2; i <= x; i++) {
			if (sieve[i] > 0)
				continue;
			for (int j = i + i; j <= x; j += i) {
				sieve[j] = i;
			}
		}
		//素数Setの作成
		Set<Integer> primeSet = new HashSet<>();
		for (int i = 2; i < sieve.length; i++) {
			if (sieve[i] == 0)
				primeSet.add(sieve[i]);
		}
	}

	//0~xまでの篩の配列を返す。配列値は素数なら0。素数でなければ、最大の素因数。(0,1は素数でないので-1)
	int[] getSieve() {
		return sieve;
	}

	//0~xまでの、素数のSetを返す
	Set<Integer> getPrimeSet() {
		return primeSet;
	}

	//素数判定
	boolean isPrime(int x) {
		return sieve[x] == 0;
	}

	//xの素因数分解結果をmapで返す(1は含まない)
	Map<Integer, Integer> primeFactrization(int x) {
		Map<Integer, Integer> map = new HashMap<>();
		while (sieve[x] > 0) {
			map.put(sieve[x], map.getOrDefault(sieve[x], 0) + 1);
			x /= sieve[x];
		}
		map.put(x, map.getOrDefault(x, 0) + 1);
		return map;
	}
}

public class Main {
	static int mod = (int) 1e9 + 7;
	static int DX[] = { -1, 0, 1, 0 }, DY[] = { 0, -1, 0, 1 };
	static final int INF = Integer.MAX_VALUE / 3;
	static final long LINF = Long.MAX_VALUE / 3;

	public static void main(String[] args) {
		FastScanner fs = new FastScanner(System.in);
		int n = fs.nextInt();
		EratosSieve es = new EratosSieve(10000);
		Map<Integer,Long> map = new HashMap<>();
		for(int i=2;i<=n;i++) {
			Map<Integer,Integer> tmap = es.primeFactrization(i);
			for(int key:tmap.keySet()) {
				int v = tmap.get(key);
				map.put(key, map.getOrDefault(key, 0L)+v);
			}
		}
		long ans = 1;
		for(int key:map.keySet()) {
			long v = map.get(key);
			ans = ans * (v+1) % mod;
		}
		System.out.println(ans);
		
	}
}

//高速なScanner
class FastScanner {
	private BufferedReader reader = null;
	private StringTokenizer tokenizer = null;

	public FastScanner(InputStream in) {
		reader = new BufferedReader(new InputStreamReader(in));
		tokenizer = null;
	}

	public String next() {
		if (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new StringTokenizer(reader.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}

	public String nextLine() {
		if (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				return reader.readLine();
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken("\n");
	}

	public long nextLong() {
		return Long.parseLong(next());
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}

	public int[] nextIntArray(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = nextInt();
		return a;
	}

	public long[] nextLongArray(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)
			a[i] = nextLong();
		return a;
	}
}