// yukicoder: No.741 AscNumber(Easy)
// 2019.5.12 bal4u

#include <stdio.h>

typedef long long ll;

#define M 1000000007
#define MAX 1000020

int fact[MAX+2], inv[MAX+2], factinv[MAX+2];

int comb(int n, int k)
{
    if (n < 0 || k < 0 || n < k) return 0;
	if (k == 0) return 1;
    return ((((ll)fact[n] * factinv[k]) % M) * factinv[n-k]) % M;
}

int main()
{
	int i, N;

	fact[0] = 1; for (i = 1; i <= MAX; i++) fact[i] = ((ll)fact[i-1]*i) % M;
	inv[1] = 1; for (i = 2; i <= MAX; i++) inv[i] = (M + (-(M/i)*(ll)inv[M % i]) % M) % M;
	factinv[0] = 1; for (i = 1; i <= MAX; i++) factinv[i] = ((ll)factinv[i-1]*inv[i]) % M;

	scanf("%d", &N);
    printf("%d\n", comb(N+9, 9));
	return 0;
}