#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int n;
  cin >> n;
  vector<vector<ll> > dp(n + 1, vector<ll>(4));
  dp[0][0] = 1;
  for (int i = 1; i <= n; ++i) {
    dp[i][0] = (((dp[i - 1][1] + dp[i - 1][2]) % MOD) + dp[i - 1][3]) % MOD;
    dp[i][1] = (((dp[i - 1][0] + dp[i - 1][2]) % MOD) + dp[i - 1][3]) % MOD;
    dp[i][2] = (((dp[i - 1][0] + dp[i - 1][1]) % MOD) + dp[i - 1][3]) % MOD;
    dp[i][3] = (((dp[i - 1][0] + dp[i - 1][1]) % MOD) + dp[i - 1][2]) % MOD;
  }
  cout << dp[n][0] << endl;
  return 0;
}