#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int add(int a, int b) {
  a += b;
  return a >= mod ? a - mod : a;
}
const int MN = 1000011;
int f[MN][2], n;
inline void Main() {
  f[0][0] = f[0][1] = 1;
  scanf("%d", &n);
  for (register int i = (1), _c = (n); i <= _c; i++)
    for (register int j = (0), _c = (1); j <= _c; j++)
      if (f[i - 1][j]) {
        (f[i][j] = add(f[i][j], f[i - 1][j]));
        if (j != i % 2) (f[i][i % 2] = add(f[i][i % 2], f[i - 1][j]));
      }
  register int ans = add(add(f[n][0], f[n][1]), mod - 2);
  printf("%d\n", ans);
}
int main() {
  Main();
  return 0;
}
