#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

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

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  vector<mint> a(100'001, 1);
  mint odd = 1, even = 0;
  for (int i = 2; i <= 100'000; ++i) {
    a[i] = i * (i % 2 == 0 ? odd : even);
    (i % 2 == 0 ? even : odd) += a[i];
  }

  int n;
  cin >> n;
  cout << a[n].val() << '\n';
  return 0;
}