#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<pair<int,int>>>;
#define MAX 60
#define MOD 1000000007
#define INF 1000000000000000000

ll modpow(ll a, ll n){
  ll ret=1;
  a%=MOD;
  while(n>0){
    if((n&1)==1){
      ret=ret*a%MOD;
    }
    n>>=1;
    a=a*a%MOD;
  }
  return ret;
}

ll modinv(ll x){
  return modpow(x,MOD-2);
}

int main(){
  ll N;
  cin>>N;
  ll ans=0;
  ans+=N*((N-1)*N/2%MOD)%MOD;
  ans%=MOD;
  ans+=MOD-(N*(N-1)%MOD)*((2*N-1)*modinv(6)%MOD)%MOD;;
  ans%=MOD;
  ans*=2*modinv(N-1);
  ans%=MOD;
  cout<<ans<<'\n';
}