#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace atcoder;
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;
const ll INF = (1LL<<61);

template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

vector<int> di = {3, 3, 2, 0, -2, -3, -3, -3, -2, 0, 2, 3};
vector<int> dj = {0, 2, 3, 3, 3, 2, 0, -2, -3, -3, -3, -2};

using mint = modint1000000007;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>N;
    if(N <= 2){
        vec ans = {1, 12, 65};
        cout<<ans[N]<<endl;
    }else{
        mint res(N);
        (res *= 6) += 1;
        res *= res;
        if(N&1) res -= 1;
        else res += 1;
        res /= 2;
        mint minus(N);
        minus *= N;
        if(N&1) minus -= 1;
        res -= minus;
        cout<<res.val()<<endl;
    }
    /*
    vector<string> grid(30, string(30, '.'));
    int si = 15, sj = 15;
    rep(k1, 12){
        rep(k2, 12){
            rep(k3, 12) {
                int i = si, j = sj;
                for(int k : {k1, k2, k3}) {
                    i += di[k];
                    j += dj[k];
                }
                grid[i][j] = 'o';
            }
        }
    }
    grid[si][sj] = 'x';
    rep(i, 30) {
        cout<<grid[i]<<endl;
    }
     */
}