#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
long long MOD = 1000000007;

typedef long long ll;

int
main(int argc, char *argv[])
{
  ll N;
  cin >> N; N--;
  ll n, k;
  n = (N / 6) % MOD;
  k = N % 6;
  ll ans = (ll(3) * n * (n + ll(1))) % MOD;
  if (k - 3 < 0) {
    ll x = n * (3 - k);
    x /= MOD;
    ans += (n * (k - 3) + (x + ll(1)) * MOD) % MOD;
  } else{
    ans += (n * (k - 3)) % MOD;
  }
  if (k == 3 || k == 4) ans += 1;
  if (k == 5) ans += 2;
  ans %= MOD;
  cout << ans << endl;
  return 0;
}