#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

ll mod = 1000007;

int main()
{
	ll n; cin >> n;

	ll ans;
	if ((n / 2 + n % 2 + 1) % mod != 0 && ((n / 2 + 1) % mod) != 0)
		ans = ((n / 2 + n % 2 + 1) % mod) * ((n / 2 + 1) % mod) - 1;
	else
		ans = (n / 2 + n % 2 + 1) * (n / 2 + 1) - 1;
	
	ans %= mod;
	cout << ans << endl;

	return	0;
}