//#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
/*#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")*/
//#pragma comment(linker, "/STACK:367077216")
#define _CRT_SECURE_NO_WARNINGS
#include <chrono>
#include <set>
#include <map>
#include <deque>
#include <string>
#include <cstdint>
#include <cmath>
#include <queue>
#include <cassert>
#include <random>
#include <bitset>
#include <iomanip>
#include <numeric>
#include <time.h>//////////////
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
//#define endl '\n'
#define mp make_pair
#define pbc push_back
#define pob pop_back()
#define empb emplace_back
#define queuel queue<long long>
#define sqr(a) ((a) * (a))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pin(p) cin >> p.first >> p.second;
#define uniq(a) sort(all(a));(a).resize(unique(all(a)) - a.begin());
#define rev(v) reverse(v.begin(), v.end());
#define sout(s, c) for (auto i : s) cout << i << c;
#define pout(p) cout << p.first << " " << p.second;
#define er(v, l, r) erase(v.begin() + l, v.begin() + r);
#define vin(v) for (ll i = 0; i < v.size(); ++i) cin >> v[i];
#define vout(v, c) for (int i = 0; i < v.size(); ++i) cout << v[i] << c;
#define pushi(v, a) for (int i = 0; i < a.size(); ++i) v.push_back(a[i]);
#define fastio() ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); srand(time(NULL))
#define dab(v) for(auto i:v)cout<<i<<' ';
#define sp system("pause")
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
using namespace std;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
const ld EPS = 1e-10;
const ld PI = acos(-1);
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
const int mod = MOD7;
const int inf = 1e9;
int add(int a, int b)
{
	a += b;
	if (a < 0)a += mod;
	if (a >= mod)a -= mod;
	return a;
}
int mul(int a, int b)
{
	return 1ll * a * b % mod;	
}
vector<vector<int>> aans;
vector<int> now;
int n;
bool check()
{
	for (int i = 0; i < n; ++i)
	{
		set<int> s;
		if (i + now[i] >= n && now[i] > 1) return 0;
		for (int x = i + 1; x <= i + now[i] &&x < n; ++x)
		{
			s.insert(now[x]);
		}
		if (s.size() > 1) return 0;
	}
	return 1;
}
void gen(int pos)
{
	if (pos == n)
	{
		if (check()) aans.pbc(now);
		return;
	}
	for (int j = 1; j <= n; ++j)
	{
		now.pbc(j);
		gen(pos + 1);
		now.pob;
	}
}
signed main()
{	
	fastio();
	cin >> n;
	vector<int> dp(n + 34);
	dp[0] = 1;
	dp[1] = 1;
	dp[2] = 1;
	dp[3] = 1;
	int sum = 3;
	for (int i = 4; i <= n + 1; ++i)
	{
		dp[i] = add(sum, -dp[i - 2]);
		sum = add(sum, dp[i]);
	}
//	for (int i = 3; i <= n + 1; ++i) dp[i] = add(dp[i], -1);
	/*for (int i = 1; i <= n; ++i)
	{
		cout << dp[i] << ' ';
	}
	cout << endl;*/
	int ans = 0;
	ans = add(ans, dp[n + 1])	;
	for (int i = 1; i < n; ++i)
	{
		ans = add(ans, mul(dp[i], mul(n - 1, n - 1)));
	}
	for (int i = 1; i <= n; ++i)
	{	
			ans = add(ans, mul(dp[i], min(i, n - 1)));
	}
//	gen(0);
	cout << ans;
//	cout << dp[n+1] << ' ' << aans.size() << endl;
	/*for (auto j : aans)
	{
		vout(j, ' ');
		cout << endl;
	}*/
	sp;
}

Measured memory_bytes: 6756