![](https://img.laitimes.com/img/9ZDMuAjOiMmIsIjOiQnIsICM38FdsYkRGZkRG9lcvx2bjxiNx8VZ6l2cskXUE1keVpmTw0keYhnRzwEMW1mY1RzRapnTtxkb5ckYplTeMZTTINGMShUYfRHelRHLwEzX39GZhh2css2RkBnVHFmb1clWvB3MaVnRtp1XlBXe0xyayFWbyVGdhd3LcV2Zh1Wa9M3clN2byBXLzN3btg3Pn5GcuYTMwEDM1EjMxEjMxAjMwIzLc52YucWbp5GZzNmLn9Gbi1yZtl2Lc9CX6MHc0RHaiojIsJye.png)
#include<iostream>
using namespace std;
const int maxmize=1010;
long long ff[maxmize][6];
const long long modnum=1000000007;
int main(){
int n;
cin>>n;
for(int i=0;i<6;i++){
ff[0][i]=0;
}
for(int i=1;i<=n;i++){
ff[i][0]=1;
ff[i][1]=(ff[i-1][0]+ff[i-1][1]*2)%modnum;
ff[i][2]=(ff[i-1][0]+ff[i-1][2])%modnum;
ff[i][3]=(ff[i-1][1]+ff[i-1][2]+ff[i-1][3]*2)%modnum;
ff[i][4]=(ff[i-1][1]+ff[i-1][4]*2)%modnum;
ff[i][5]=(ff[i-1][3]+ff[i-1][4]+ff[i-1][5]*2)%modnum;
}
cout<<ff[n][5];
return 0;
}
多的不谈,动态规划,永远滴神