using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var m = NN; var mod = 1_000_000_007; var dp = new long[m + 1][]; dp[0] = new long[0]; for (var i = 1; i < dp.Length; ++i) { dp[i] = new long[m / i + 1]; dp[i][1] = 1; } for (var i = m; i > 0; --i) { var plist = PList(i); for (var j = 1; j < dp[i].Length; ++j) { foreach (var p in plist) if (i * j + p <= m) { dp[p][i * j / p + 1] = (dp[p][i * j / p + 1] + dp[i][j]) % mod; } } } var ans = 0L; for (var i = 1; i <= m; ++i) if (m / i * i == m) ans = (ans + dp[i][m / i]) % mod; WriteLine(ans); } static List PList(int n) { var ans = new List(); var rev = new List(); for (var i = 1; i * i <= n; ++i) { if (n % i == 0) { ans.Add(i); if (i * i < n) rev.Add(n / i); } } rev.Reverse(); ans.AddRange(rev); return ans; } }