#include<iostream>
#include<iomanip>

#include<cmath>
#include<algorithm>
#include<numeric>

#include<vector>
#include<string>
#include<set>
#include<map>
//#include<atcoder/all>

#define fi first
#define se second
#define pb(x) emplace_back(x)

using namespace std;
using ll = long long;
using v_ll = vector <ll>;

bool IS_TEST=false;
ll INF = ll(1e17);

ll max(ll x,ll y){return x>y?x:y;}
ll min(ll x,ll y){return x<y?x:y;}
template<class T> bool chmax(T& x,const T& y){ if (x>=y) return false; x=y; return true;}
template<class T> bool chmin(T& x,const T& y){ if (x<=y) return false; x=y; return true;}
template<class T> void quit(T x){std::cout << x << "\n"; exit(0);}

template<typename T> void vshow(T x){for(auto itr = x.begin();itr!=x.end();itr++){std::cerr << *itr << " ";} std::cerr << "\n";}
template<typename T> void vvshow(T x){for(auto itr = x.begin();itr!=x.end();itr++){vshow(*itr);} std::cerr << "\n";}

int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  ll N;
  cin >> N;
  if (N==0) cout << 1 << "\n";
  else if (N==1) cout << 12 << "\n";
  else if (N==2) cout << 65 << "\n";
  else cout << ((17LL*N%1000000007LL*N%1000000007LL+6*N+1)%1000000007LL) << "\n";
}