#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
const long long mod = 1e9 + 7;
int n, aa[N + 2];
long long dp[N + 2][3];
long long dfs(int st, int ls) {
  if (st > n) return (bool)ls;
  if (dp[st][ls] != -1) return dp[st][ls];
  long long now = 0;
  now = (now + dfs(st + 1, ls)) % mod;
  if (ls != aa[st]) now = (now + dfs(st + 1, aa[st])) % mod;
  return dp[st][ls] = now % mod;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) aa[i] = 1 + (i % 2);
  memset(dp, -1, sizeof(dp));
  cout << dfs(1, 0) << endl;
  return 0;
}
