#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;

int add(int a,int b) {
    int g = (a+b)%mod;
    if(g < 0)
        g += mod;
    return g;
}

int mul(int a, int b) {
    long long g = (1LL*a*b)%mod;
    return (int) g;
}

int power(int b, int p) {
    if(p == 0)
        return 1;
    
    int g = power(b,p/2);
    g = mul(g,g);
    if(p%2 == 1)
        g = mul(g,b);
    return g;
}

int inv(int b) {
    return power(b,mod-2);
}

int main() {
    int n; cin>>n;
    cout<<mul(n,mul(inv(3),n+1));
    return 0;
}