#include #include using namespace std; const int limn = 1e6; int dp[limn+10][3]; int divn = 1e9 + 7; int main(){ memset(dp,0,sizeof(dp)); int n; cin >> n; dp[0][0] = 1; for(int i = 0;i < n;i++){ for(int j = 0;j < 3;j++){ for(int k = 0;k < 3;k++){ if(i==0){ dp[i+k+1][k] = (dp[i+k+1][k] + dp[i][j]) % divn; }else{ if(j != k){ dp[i+k+1][k] = (dp[i+k+1][k] + dp[i][j]) % divn; } } } } } int ans = 0; for(int i = 0;i < 3;i++) ans = (ans + dp[n][i]) % divn; cout << ans << endl; return 0; }