#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

/* 二項係数 C(n,k) mod p を計算 */
const int MOD = 1000000007;
const int MAX = 201000;
long long fac[MAX], finv[MAX], inv[MAX];

void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}

long long COM(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
  ll n;
  cin >> n;
  COMinit();
  ll a = ((n - 4) % 3 == 0);                                       // 3つ同じ
  ll b = a ? (n - 4) / 2 * 3 % MOD : (1 + (n - 4) / 2) * 3 % MOD;  // 2つ同じ
  ll c = (n - 2) % MOD * (n - 3) % MOD * inv[2] % MOD;             //全体
  // DUMP(a);
  // DUMP(b);
  // DUMP(c);
  ll ans = (c - b - a + 2 * MOD) % MOD * finv[3] % MOD +
           (b) % MOD * inv[3] % MOD + a % MOD;
  cout << ans << endl;
}