#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip>
using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int main(void) {
	ll n;
	cin>>n;
	if(n==4){
		cout << 1 << endl;
		return 0;
	}
	n-=5;
	ll a = (n/6)%MOD;
	ll b = n%6%MOD;
	ll sum_a = ((((3*a)%MOD)*(a-1))%MOD+7*a)%MOD;
	ll d[6] = {0,0,0,0,0,1};
	ll sum_b = ((a+1)*b)%MOD+d[b];
	cout << (1+sum_a+sum_b)%MOD << endl;
	return 0;
}