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

ll h;
ll mo = 1000000007;

ll modpow(ll a, ll n = mo - 2) {
	ll r = 1; a %= mo;
	while (n) r = r * ((n % 2) ? a : 1) % mo, a = a * a % mo, n >= 1;
	return r;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int i, j, k, l, r, x, y; string S;

	cin >> h;
	h -= 4;

	ll ret = 0;

	ret = (h / 2 + 1) % mo;

	ll ma = (h - 2) / 3;
	ll a[2];
	a[0] = max(0ll, (h - 1) / 2);
	a[1] = max(0ll, (h - 4) / 2);
	rep(i, 2) if (a[i] > 0) {
		ll b = a[i] / 3 + 1;
		ll c = a[i] % 3;
		ret += c * (b % mo);
		ret += 3 * (b % mo) * ((b - 1) % mo) % mo * (mo + 1) / 2 % mo;
	}

	cout << ret % mo << endl;
	return 0;
}