#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=INF;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=100010;

set<pll>st;
void solve(pll now,ll i,ll n){
    if(i==n){
        st.insert(now);
        return;
    }
    ll x=now.fi,y=now.se;
    solve(mp(x+3,y),i+1,n);
    solve(mp(x+3,y+2),i+1,n);
    solve(mp(x+2,y+3),i+1,n);
    solve(mp(x,y+3),i+1,n);
    solve(mp(x-2,y+3),i+1,n);
    solve(mp(x-3,y+2),i+1,n);
    solve(mp(x-3,y),i+1,n);
    solve(mp(x-3,y-2),i+1,n);
    solve(mp(x-2,y-3),i+1,n);
    solve(mp(x,y-3),i+1,n);
    solve(mp(x+2,y-3),i+1,n);
    solve(mp(x+3,y-2),i+1,n);
}


signed main(){
    ll n;cin>>n;
    if(n==0){
        cout<<1<<endl;
    }else if(n==1){
        cout<<12<<endl;
    }else if(n==2){
        cout<<65<<endl;
    }else if(n==3){
        cout<<172<<endl;
    }else if(n%2==0){
        ll z=n*6LL+1;
        ll ans=(z*z%mod+1LL)%mod*500000004LL%mod;
        ans=(ans-n/2LL*n/2LL%mod*4LL%mod)%mod;
        if(ans<0)ans+=mod;
        cout<<ans<<endl;
    }else{
        ll z=n*6LL+1;
        ll b=n/2;
        ll ans=(z*z-1LL)%mod*500000004LL%mod;
        ans=(ans-b*(b+1)%mod*4LL%mod)%mod;
        if(ans<0)ans+=mod;
        cout<<ans<<endl;
    }
    //solve(mp(0,0),0,n);
    //cout<<st.size()<<endl;
    /* 
    rep(i,50){
        rep(j,50){
            if(st.find(mp(i-25,j-25))!=st.end()){
                cout<<1;
            }else{
                cout<<0;
            }
        }
        cout<<endl;
    }
    */
}