How many infinite sequences a_1, a_2, ... consisting of {{1, ... ,n}} satisfy the following conditions?

* The n-th and subsequent elements are all equal. That is, if n \leq i,j, a_i = a_j.
* For every integer i, the a_i elements immediately following the i-th element are all equal. That is, if i < j < k\leq i+a_i, a_j = a_k.



Find the count modulo 10^9+7.

Constraints

* 1 \leq n \leq 10^6

Input

Input is given from Standard Input in the following format:


n


Output

Print how many sequences satisfy the conditions, modulo 10^9+7.

Examples

Input

2


Output

4


Input

654321


Output

968545283
#include <iostream>
#include <vector>

using namespace std;
typedef long long ll;

constexpr ll MOD = 1e9 + 7;

int main() {
    ll n;
    cin >> n;

    vector<ll> dp(n + 1);
    dp[n] = n;
    ll sum = dp[n];
    for (int i = n - 1; i > 0; i--) {
        //next is 1
        dp[i] = sum;
        if (i + 2 <= n)dp[i] += MOD - dp[i + 2];
        dp[i] += min((int) n - 1, i + 1), dp[i] %= MOD;
        //next is not 1
        dp[i] += (n - 1) * (n - 1), dp[i] %= MOD;
        sum += dp[i], sum %= MOD;
    }

    cout << dp[1] << endl;
    return 0;
}