#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

#include <atcoder/modint>
using namespace atcoder;
using mint = modint1000000007;

int main() {
  int n;
  cin >> n;
  vector dp(3, vector<mint>(3));
  dp[1][0] = 1;
  rrep(i, n - 1) {
    vector p(3, vector<mint>(3));
    swap(dp, p);
    rep(j, 2) rep(k, 2) {
      if (!j && !k)
        dp[k][1] += p[j][k];
      else if (k)
        dp[k][0] += p[j][k];
      else {
        dp[k][0] += p[j][k];
        dp[k][1] += p[j][k];
      }
    }
  }
  mint ans;
  rep(j, 2) rep(k, 2) ans += dp[j][k];
  cout << ans.val() << endl;
  return 0;
}