#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
const long long inf = 0x3f3f3f3f3f3f3f3fll;
using namespace std;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
void d1(long long x) { cout << x << endl; }
void d2(long long x, long long y) { cout << x << " " << y << endl; }
void d3(long long x, long long y, long long z) {
  cout << x << " " << y << " " << z << endl;
}
void d4(long long w, long long x, long long y, long long z) {
  cout << w << " " << x << " " << y << " " << z << endl;
}
void da(long long a[], long long n) {
  for (long long i = 0; i < n; i++) cout << a[i] << " ";
  cout << endl;
}
void dv(vector<long long>& v) {
  for (long long i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << endl;
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  long long n, i, f = 1, s = 1;
  cin >> n;
  for (i = 0; i < 3 * n; i++) f = (f * 3) % 1000000007;
  for (i = 0; i < n; i++) s = (s * 7) % 1000000007;
  if (f < s)
    cout << ((1000000007 - s) + f) % 1000000007;
  else
    cout << f - s;
  return 0;
}
