import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum long mod = 10 ^^ 9 + 7;

void main() {
    int n;
    scan(n);

    auto f = new long[](n + 100);
    f[0] = f[1] = 1;
    foreach (i ; 2 .. n + 100) {
        f[i] = f[i-1] * i % mod;
    }
    auto rf = new long[](n + 100);
    rf[n + 99] = powmod(f[n + 99], mod - 2, mod);
    foreach_reverse (i ; 0 .. n + 99) {
        rf[i] = rf[i+1] * (i+1) % mod;
    }

    long comb(int n, int k) {
        return f[n] * rf[k] % mod * rf[n-k] % mod;
    }

    long ans;

    foreach (i ; 0 .. 10) {
        debug {
            writeln(comb(n - 1 + i, i));
        }
        ans += comb(n - 1 + i, i);
        ans %= mod;
    }

    writeln(ans);
}

long powmod(long x, long y, long mod) {
    return y > 0 ? powmod(x, y>>1, mod)^^2 % mod * x^^(y&1) % mod : 1;
}




























void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}