考虑每个有3种选择所以共有3^(3*n)其中没三个有7种不能选择所以有代码
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
#define MOD 1000000007
using namespace std;
int main()
{
long long n;
while(scanf("%lld",&n)!=EOF){
long long ans=1,num=1;
for(int i=1;i<=n;++i){
ans=ans*27%MOD;num=num*7%MOD;
}
printf("%lld\n",(ans-num+MOD)%MOD);
}
return 0;
}