#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const ll MOD = (ll)1e6 + 7LL;	

int main()
{
	ios_base::sync_with_stdio(0);
	ll N; cin >> N;

	ll res = 0LL;
	if (N % 2 == 0 ){
		N /= 2LL;
		res = ((N % MOD )*((N + 2LL ) % MOD ) ) % MOD;
	}else{
		N /= 2LL;
		res = ((N % MOD )*((N + 3LL ) % MOD ) + 1LL ) % MOD;
	} // end if

	cout << res << endl;

	return 0;
}