#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
const int mod = 1000007; 
int main(){
    ll N;
    cin >> N;
    ll maxv = 0;
    for(ll i = N/2-10; i <= N/2+10; i++){
        ll v = (-(i%mod)*(i%mod) + (N%mod)*(i%mod) + N%mod)%mod;
        maxv = max(maxv, v);
    }
    cout << maxv << endl;
    return 0;
}