#include <bits/stdc++.h>

using namespace std;

#define int long long
#define itn int
#define iont int
#define all(n) (n).begin(), (n).end()
#define pb push_back
#define sz size()
#define mod 1000000007
using vi = vector<int>;
using vvi = vector<vi>;
using vc = vector<char>;
using vcc = vector<vc>;

int xin() {
    int n; cin>>n;
    return n;
}




void ducks(){
    int n;
    cin>>n;
    int t;
    t = 1;
    for (int i = 4*n - 2*n + 1; i <= 4 * n -4; i++)
    {
        t = (t * i) % mod;
    }
    t /= 24;
    t = (t * n) % mod;
    t -= 2 * (n - 1);
    cout << t;
}

int hashh(int sofar, int el) {
    return (sofar * (1000000007) + el) % 1000000009; // TODO Remake!!!
}
void Book() {
    int n=xin(), q=xin();
    string s; cin>>s;
    set<pair<pair<int, int>, int>> s1;
    set<pair<int, pair<int, int>>> s2;
    for(int i = 0; i<n; i++) {
        for(int len = 1; len<=5; len++) {
            int curHash = 0;
            for(int j = i; j<=i + len - 1 && j < s.sz; j++) {
                curHash = hashh(curHash, (int)s[j]);
            }
            s1.insert({{i, i + len - 1}, curHash});
            s2.insert({curHash, {i, i + len - 1}});
        }
    }

    while(q--) {
        int x=xin();
        string ss; cin>>ss;
        int curHash = 0;
        for(int i = 0; i<ss.sz; i++) {
            curHash = hashh(curHash, ss[i]);
        }
        auto lb = s2.lower_bound({curHash, {-1, -1}});
        if(lb == s2.end() || lb->first != curHash) cout<<0<<endl;
        else {
            cout<<1<<endl;
            auto el = *lb;
            cout<<el.first<<' '<<el.second.first<<' '<<el.second.second<<endl;
            for(int i = max(0ll, el.second.first - (5 - 1)); i<=min(n - 1, (int)el.second.second); i++) {
                int len = el.second.first - i + 1;
                while(true) {
                    auto it = s1.lower_bound({{i, i + len - 1}, -1});
                    if(it == s1.end() || it->first.first != i) break;
                    auto itel = *it;
                    s1.erase(it);
                    s2.erase(s2.find({itel.second, {itel.first.first, itel.first.second}}));
                }
            }
        }
    }
}
/*
3 5
bna
3
ban
 */

//void book1(){
//    int n, m;
//    cin>>n>>m;
//    string s;
//    cin>>s;
//    while (m--){
//        int x;
//        string subs;
//        cin>>x>>s;
//        int flag = 0;
//        int l = 0, r = subs.size();
//        for(int i = r; i<=s.size(); r++){
//            if(subs[l] == s[l] && subs[r] == s[r]){
//                int l1 = l, r1 = r;
//                while(l1!=r1){
//                    l1--;
//                    r1--;
//                   if(subs[l] != s[l] || subs[r] != s[r]){
//                       flag = 1;
//                       break;
//                   }
//                   if (!flag){
//
//                   }else flag = 0;
//                }
//            }
//        }
//
//    }
//}



signed main() {
    //Snow9();
    ducks();
    //Book();
    //book1();
}