Rng(求逆元)

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<map>
#include<cmath>
const int maxn=1e5+5;
const long long  mod=1e9+7; 
typedef long long ll;
using namespace std;

ll ksm(ll x,ll y)
{
  ll ans=1;
  while(y)
  {
      if(y&1)
      ans=ans*x%mod;
      y>>=1;
      x=x*x%mod;
  }
  return ans;
} 
int main()
{
   ll n;
   while(cin>>n)
   {
       ll p=(n+1)*n/2;
       ll q=n*n;
       printf("%lld\n",(p*ksm(q,mod-2))%mod);
   } 
   return 0;
}