#include typedef long long ll; const ll MOD = 1000000007, LINE = 1000000000; using namespace std; ll dfs(ll i); int main() { ll n, ans; scanf("%lld", &n); ans = dfs(n); printf("%lld\n", ans); return 0; } ll dfs(ll i) { if (i == 0) return 1; ll n = dfs(i - 1); i %= MOD; if (i > LINE && n > LINE) { return ((LINE * LINE) % MOD + (i - LINE) * LINE + (n - LINE) * LINE + (i - LINE) * (n - LINE)) % MOD; } else if (i > LINE && n <= LINE) { return ((LINE * n) % MOD + (i - LINE) * n) % MOD; } else if (i <= LINE && n > LINE) { return ((LINE * i) % MOD + (n - LINE) * i) % MOD; } else { return (i * n) % MOD; } }