#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}
#define MOD 1000000007
int main() {
	int64_t n;
	std::cin >> n;
	n -= 4;
	int64_t res = 0;
	int64_t max1 = n / 3; // 0..max1
	int64_t max2 = n / 2;
	max1++;
	res += max1 % 2 ? (max1 + 1) / 2 % MOD * (max1 % MOD) % MOD : max1 / 2 % MOD * ((max1 + 1) % MOD) % MOD;
	max1--;
	int64_t first = (n - 2 * (max1 + 1)) + 1;
	int64_t second = (n - 2 * max2) + 1;
	int64_t num = (max2 - max1) % MOD;
	first += second;
	assert(first % 2 == 0 || num % 2 == 0);
	if (first % 2) res += (num / 2 % MOD * (first % MOD) % MOD);
	else res += (first / 2 % MOD * (num % MOD) % MOD);
	std::cout << res % MOD << std::endl;
	return 0;
}