#include<bits/stdc++.h>
#define ll long long
#define lowbit(x) (x&-x)
using namespace std;
const int N = 1e6+7, p = 1e9+7;
int mul(int a, int b)
{
    return (ll)a*b%p;
}
void add(int & a, int b)
{
    a += b;
    if(a>=p)
    {
        a -= p;
    }
    return;
}
struct matrix
{
    int a[3][3];
    matrix()
    {
        memset(a, 0, sizeof(a));
        a[2][1] = 2;
        a[1][1] = a[1][2] = a[2][2] = 1;
        return;
    }
    void init()
    {
        memset(a, 0, sizeof(a));
        return;
    }
    void Init()
    {
        memset(a, 0, sizeof(a));
        a[1][1] = a[2][2] = 1;
    }
    matrix operator * (const matrix & an)const
    {
        matrix ret;
        ret.init();
        for(int i = 1; i <= 2; i++)
        {
            for(int j = 1; j <= 2; j++)
            {
                for(int k = 1; k <= 2; k++)
                {
                    add(ret.a[i][j], mul(a[i][k], an.a[k][j]));
                }
            }
        }
        return ret;
    }
};
matrix qpow(int k)
{
    matrix ret, x;
    ret.Init();
    while(k)
    {
        if(k&1)
        {
            ret = ret*x;
        }
        x = x*x;
        k >>= 1;
    }
    return ret;
}
int main()
{
    int n;
    freopen("AABB.in", "r", stdin);
    freopen("AABB.out", "w", stdout);
    scanf("%d", &n);
    matrix res = qpow(n-1);
    printf("%lld\n", (res.a[1][1]+res.a[2][1]+(res.a[1][2]+res.a[2][2])*2ll)%p);
    return 0;
}