Problem:
Score : 400 points

Problem Statement

You are given an integer N. Find the number of strings of length N that satisfy the following conditions, modulo 10^9+7:

The string does not contain characters other than A, C, G and T.

The string does not contain AGC as a substring.

The condition above cannot be violated by swapping two adjacent characters once.

Notes

A substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.

For example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.

Constraints

3 \leq N \leq 100

Input

Input is given from Standard Input in the following format:

N

Output

Print the number of strings of length N that satisfy the following conditions, modulo 10^9+7.

Sample Input 1

3

Sample Output 1

61

There are 4^3 = 64 strings of length 3 that do not contain characters other than A, C, G and T. Among them, only AGC, ACG and GAC violate the condition, so the answer is 64 - 3 = 61.

Sample Input 2

4

Sample Output 2

230

Sample Input 3

100

Sample Output 3

388130742

Be sure to print the number of strings modulo 10^9+7.

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#define ll long long
const ll mod = pow(10,9) + 7;
int dp[101][6][6][6][6];
int N;
int p(int n, int a, int b, int c, int d){
    if(dp[n][a][b][c][d] != -1)
        return dp[n][a][b][c][d];
    if(a == 1 && c == 3 && d == 2)
        return 0;
    if(a == 1 && b == 3 && d == 2)
        return 0;
    if(b == 1 && c == 3 && d == 2)
        return 0;
    if(b == 1 && c == 2 && d == 3)
        return 0;
    if(b == 3 && c == 1 && d == 2)
        return 0;
    if(n == N)
        return 1;
    ll ans = 0;
    for(int i = 1; i < 5; i++)
        ans += p(n + 1, b, c, d, i);
    return dp[n][a][b][c][d] = ans % mod;
}
int main(){
    scanf("%d",&N);
    memset(dp, -1, sizeof(dp));
    printf("%d\n",p(0,5,5,5,5));
    return 0;
}