#include <bits/stdc++.h>

using namespace std;

const int mod = 1e9 + 7;
int dp[1 << 20][3];

int main(void) {
  int n;
  cin >> n;

  dp[1][0] = 1;
  dp[1][1] = 0;
  dp[1][2] = 0;
  for (int i = 1; i < n; i++) {
    for (int j = 0; j < 3; j++) {
      if (j == 0) {
        dp[i + 1][1] += dp[i][0];
        dp[i + 1][1] %= mod;
        dp[i + 1][2] += dp[i][0];
        dp[i + 1][2] %= mod;        
      } else if (j == 1) {
        dp[i + 1][2] += dp[i][1];
        dp[i + 1][2] %= mod;
      } else {
        dp[i + 1][0] += dp[i][2];
        dp[i + 1][0] %= mod;        
      }
    }
  }

  int ans = 0;
  for (int i = 0; i < 3; i++) {
    ans += dp[n][i];
    ans %= mod;
  }
  cout << ans << endl;

  return 0;
}