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(); public static void Main() { Solve(); } static void Solve() { var n = NN; var mod = 1_000_000_007; var dp = new long[n, n]; for (var j = 0; j < n; ++j) dp[0, j] = 1; for (var i = 1; i < n; ++i) { var up = Math.Max(0, i - 2); for (var j = 0; j < n; ++j) dp[i, Math.Max(0, j - up)] = (dp[i, Math.Max(0, j - up)] + dp[i - 1, j]) % mod; for (var j = 1; j < n; ++j) dp[i, j] = (dp[i, j] + dp[i, j - 1]) % mod; } var ans = 0L; for (var j = 0; j < n; ++j) ans = (ans + dp[n - 1, j]) % mod; for (var i = 0; i < n; ++i) for (var j = 0; j < n; ++j) dp[i, j] = 0; dp[0, 0] = 1; for (var i = 1; i < n; ++i) { var up = Math.Max(0, i - 2); for (var j = 0; j < n; ++j) dp[i, Math.Max(0, j - up)] = (dp[i, Math.Max(0, j - up)] + dp[i - 1, j]) % mod; for (var j = 1; j < n; ++j) dp[i, j] = (dp[i, j] + dp[i, j - 1]) % mod; } ans = (ans - dp[n - 1, n - 1] + mod) % mod; WriteLine(ans); } }