#include <stdio.h>
#include <iostream>

long long modinv(long long a,long long m) {
    long long b=m,u=1,v=0;
    long long t;
    while(b) {
        t=a/b;
        a-=t*b;
        std::swap(a,b);
        u-=t*v;
        std::swap(u,v);
    }
    u%=m;
    if(u<0)u+=m;
    return u;
}

int main() {
    long n;
    scanf("%ld",&n);
    long c=1;
    long p=1;
    for (int i=n;i!=0;i--) {
        c=c*(9+i)%1000000007;
        p=p*i%1000000007;
    }
    printf("%ld\n", c*modinv(p,1000000007)%1000000007);
    return 0;
}