// No.72 そろばん Med
// https://yukicoder.me/problems/no/72
//
#include <iostream>
using namespace std;

long long solve(long long N);
long long calc_max(long long N, long long x);


int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    long long N;
    cin >> N;
    long long ans = solve(N);
    cout << ans << endl;
}

long long solve(long long N) {
    long long ub = N;
    long long lb = 1;

    while (true) {
        long long mid1 = (lb * 2 + ub) / 3;
        long long mid2 = (lb + ub * 2) / 3;
        long long mid1_score = calc_max(N, mid1);
        long long mid2_score = calc_max(N, mid2);
        if (mid2_score < mid1_score)
            ub = mid2;
        else
            lb = mid1;
        if (ub - lb <= 4)
            break;
    }

    long long ans = 0;
    for (long i = lb; i <= ub; ++i)
        ans = max(ans, calc_max(N, i));
    return ans % 1000007;
}


long long calc_max(long long N, long long x) {
    long long tmp;
    tmp = (N%1000007 * x%1000007) + N;
    return (tmp - (x%1000007 * x%1000007))%1000007;
}