#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod=1000000007;
const int N=1010;
ll a[N];
ll b[N];
int main(){
int n;scanf("%d",&n);
if(n==1){
printf("%d\n",2);
return 0;
}
b[0]=1;
a[1]=1;
a[2]=6;
for(int i=1;i<=n;i++){
b[i]=b[i-1]*2%mod;
}
ll ans=0;
for(int i=3;i<=n;i++){
a[i]=((2*a[i-1]%mod+b[i-1])%mod+4*a[i-2]%mod)%mod;
}
ans=ans+4*a[n]%mod;
//cout<<ans<<endl;
for(int i=2;i<=n-1;i++){
ans=(ans+(2*((2*b[i-1]%mod*a[n-i]%mod)%mod+(2*b[n-i]%mod*a[i-1]%mod)%mod)%mod)%mod)%mod;
}
printf("%lld\n",ans);
return 0;
}