#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;

#define MOD 1000007

long long func(long long &n, long long i){
	return ((i+1)*(n-i+1) - 1);
}

int main(){
	long long n;
	cin >> n;
	long long ans = func(n, 1);
	ans = max(ans, func(n, n));
	for(int i=-4; i<=4; i++){
		if(n/2 + i < 0 || n/2+i > n) continue;
		ans = max(ans, func(n, n/2+i) );
	}
	
	cout << ans%MOD << endl;
	return 0;
}