#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

const int MOD=1e9+7;

int main(){
  ll n;
  cin>>n;
  
  if(n==1) cout<<12<<endl;
  else if(n==2) cout<<65<<endl;
  else{
    ll ans=0;
    ans=n*n%MOD;
    ans=ans*17%MOD;
    ans=(ans+6*n+1)%MOD;
    cout<<ans<<endl;
  }

  return 0;
}