#include <stdio.h>

 #include <stdlib.h>

 #include <string.h>

 #define MOD 1000000007

 long long a[] = {};

 long long b[] = {};

 int main(void)

 {

     int i,n;

     long long sum;

     long long a[] = {,,,};

     long long b[] = {,,,};

     scanf("%d",&n);

     for (i= ; i<=n ; i++)

     {

         b[i] = (b[i-]*%MOD);    //以固定方向行走的方案数

         a[i] = (*a[i-]+b[i]+*a[i-])%MOD;//顶角的所有行走方案数

     }

     sum = *a[n];    //4个角可走的总方案数

     for (i= ; i<n ; i++)

     {

         sum += ((*b[n-i]*a[i-])%MOD + (*a[n-i]*b[i-])%MOD)%MOD;

         sum %= MOD;

     }

     if (n==)

         sum = ;

     printf("%ld",sum);

     return ;

 }