#include <bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) REP(i,0,n)
#define INF (1<<30)
#define INFLL (1LL<<62LL)

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, -1, 1};

int N;
int dp[1000001][2][2];
const int mod = 1000000007;
enum { KEN = 0, PA, CONT=0, NOT_CONT };

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  cin >> N;

  dp[0][KEN][CONT] = 0;
  dp[0][KEN][NOT_CONT] = 1;
  dp[0][PA][NOT_CONT] = 0;
  dp[0][KEN][CONT] = 0;

  REP(i, 1, N) {
    dp[i][KEN][CONT] = dp[i-1][KEN][NOT_CONT];
    dp[i][KEN][NOT_CONT] = dp[i-1][PA][NOT_CONT];
    dp[i][PA][NOT_CONT] = (dp[i-1][KEN][CONT] + dp[i-1][KEN][NOT_CONT]) % mod;
  }

  int ans = (dp[N-1][KEN][CONT] + dp[N-1][KEN][NOT_CONT]) % mod;
  ans = (ans + dp[N-1][PA][NOT_CONT]) % mod;
  cout << ans << endl;

  return 0;
}