#define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; const int MOD = 1000000007; template vector > matrixProduct(const vector >& x, const vector >& y) { int a = x.size(); int b = x[0].size(); int c = y[0].size(); vector > z(a, vector(c, 0)); for(int i=0; i vector > matrixPower(const vector >& x, long long k) { int n = x.size(); vector > y(n, vector(n, 0)); for(int i=0; i > z = x; while(k > 0){ if(k & 1) y = matrixProduct(y, z); z = matrixProduct(z, z); k >>= 1; } return y; } const vector STATE ={ "____", "AA__", "_AA_", "__AA", "A_A_", "_A_A", "A__A", "AABB", "ABBA" }; const int STATE_NUM = STATE.size(); const char EMPTY = '_'; const string EMPTY_STR(4, EMPTY); string normalizeState(const string& s) { char newChar = 'A'; map to; to[EMPTY] = EMPTY; string t; for(char c : s){ if(to.find(c) == to.end()){ to[c] = newChar; ++ newChar; } t.push_back(to[c]); } return t; } int main() { long long n; cin >> n; vector > mat(STATE_NUM*2+1, vector(STATE_NUM*2+1, 0)); mat[STATE_NUM*2][STATE_NUM*2] = 1; for(int a=0; a upper; for(int i=0; i<4; ++i) upper[i] = (s[i] != EMPTY); for(int i=0; i<(1<<3); ++i){ bitset<5> side(i << 1); bool ng = false; int cnt = 0; for(int j=0; j<4; ++j){ if(upper[j] && side[j] && side[j+1]) ng = true; if(upper[j] || side[j] || side[j+1]) ++ cnt; } if(ng) continue; string t = s; int sameCnt = 0; char newChar = 'Z'; for(int j=0; j<4; ++j){ if(!side[j]){ int k = j; while(side[k+1]) ++ k; if(j < k){ if(s[j] == EMPTY && s[k] == EMPTY){ t[j] = t[k] = newChar; -- newChar; } else if(s[j] == EMPTY || s[k] == EMPTY){ swap(t[j], t[k]); } else if(s[j] == s[k]){ t[j] = t[k] = EMPTY; ++ sameCnt; } else{ replace(t.begin(), t.end(), s[j], s[k]); t[j] = t[k] = EMPTY; } } } } if(sameCnt >= 2 || (sameCnt == 1 && t != EMPTY_STR)) continue; if(t == EMPTY_STR && cnt > 0){ ++ mat[STATE_NUM*2][a+STATE_NUM]; mat[STATE_NUM*2][a] += cnt; } else{ t = normalizeState(t); int b = find(STATE.begin(), STATE.end(), t) - STATE.begin(); ++ mat[b][a]; ++ mat[b+STATE_NUM][a+STATE_NUM]; mat[b+STATE_NUM][a] += cnt; } } } mat = matrixPower(mat, n+1); cout << mat[STATE_NUM*2][0] << endl; return 0; }