#include <bits/stdc++.h>

using namespace std;
typedef long long LL;
const int mod = 1e9 + 7;

// 快速幂
int qmi(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = (LL)res * a % mod;
        a = (LL)a * a % mod;
        b >>= 1;
    }
    return res;
}
int main() {
    LL n;
    cin >> n;
    LL a = (n * (n + 1)) % mod;
    a = a * (2 * n + 1) % mod;
    a = a * qmi(6, mod - 2) % mod;
    cout << a << endl;
    return 0;
}