import java.io.*;
import java.util.Scanner;


public class Main_yukicoder741 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		final int MOD = 1_000_000_007;

		int n = sc.nextInt();

		long[][] dp = new long[10][n];
		for (int i = 0; i < 10; i++) {
			dp[i][0] = 1;
		}
		
		for (int i = 0; i < n - 1; i++) {
			for (int j = 0; j < 10; j++) {
				for (int k = j; k < 10; k++) {
					dp[k][i + 1] += dp[j][i];
//					dp[k][i + 1] %= MOD;
					if (dp[k][i + 1] >= MOD) {
						dp[k][i + 1] -= MOD;
					}
				}
			}
		}
		
		long ans = 0;
		for (int i = 0; i < 10; i++) {
			ans += dp[i][n - 1];
			ans %= MOD;
		}
		
		pr.println(ans);
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);
			
		solve();
			
		pr.close();
		sc.close();
	}

	static class Printer extends PrintWriter {
		Printer(OutputStream out) {
			super(out);
		}
	}
}