#ifdef ONPC
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

using namespace std;
/// Pragmas ///
/// define ///
#define pii pair<int, int>
#define pll pair<ll, ll>
#define V vector
#define MP make_pair
#define vi vector<int>
#define ff first
#define ss second
#define vl vector<long long>
/// typedef ///
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

/// solve ///

const int MOD = 1000000007;
int n = 3;

int get(int mask, int i) { return (mask >> i) & 1; }

bool check(int mask1, int mask2) {
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    if (get(mask1, i) == 0 && get(mask2, i) != 1) {
      return false;
    } else {
      if (get(mask1, i) == 1 && get(mask2, i) == 1) {
        cnt++;
      } else {
        if (cnt % 2 != 0) {
          return false;
        } else {
          cnt = 0;
        }
      }
    }
  }
  if (cnt % 2 != 0) {
    return false;
  } else {
    return true;
  }
}
void solve() {
  int m;
  cin >> m;
  vector<vector<int>> dp(m + 1, vector<int>((1 << n), 0));
    dp[0][(1 << n) - 1] = 1;
  for (int i = 0; i < m; i++) {
    for (int p = 0; p < (1 << n); p++) {
      for (int q = 0; q < (1 << n); q++) {
        if (check(p, q)) {
          dp[i+1][q] += dp[i][p];
                    dp[i][q] %= MOD;
        }
      }
    }
  }
  cout << dp[m][(1 << n) - 1] % MOD << '\n';
}

signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  int t = 1;
  // cin >> t;
#ifdef ONPC
  std::cout << std::unitbuf;
#endif
  while (t--)
    solve();
#ifdef ONPC
  cout << endl << "__________________________" << endl;
#endif
#ifdef ONPC
  cout << endl
       << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
  cerr << endl
       << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
  return 0;
}