#include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#include <cassert>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>

#include <chrono>
#include <random>
#include <thread>
#include <unordered_map>
#include <unordered_set>

using namespace std;

#define all(c) c.begin(), c.end()
#define repeat(i, n) for (int i = 0; i < static_cast<int>(n); i++)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "{";
    for (auto it = v.begin(); it != v.end(); ++it) {
        if (it != v.begin())
            os << ",";
        os << *it;
    }
    return os << "}";
}

template <typename A, typename B>
ostream& operator<<(ostream& os, const pair<A, B>& v)
{
    os << "{";
    os << v.first << ", " << v.second;
    return os << "}";
}

// ---------------------------------------------------------------------------

// これを解くわよ！ https://atcoder.jp/contests/abc122/tasks/abc122_d

using point = complex<double>;
using ll = int64_t;

const ll MOD = 1000000007LL;
int my_main(int argc, char** argv)
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N;
    cin >> N;

    const std::vector<char> base = {
        'A',
        'C',
        'G',
        'T',
        'X'
    };


    auto index = [&base](char a) -> int {
        for (int i = 0; i < base.size(); i++) {
            if (base[i] == a)
                return i;
        }
        abort();
    };

    // 0 ~ 120 にマップする
    auto encode = [base, index](const std::vector<char>& s) {
        int ret = 0;
        for (int i = 0; i < s.size(); i++) {
            ret = ret * base.size() + index(s[i]);
        }
        return ret;
    };
    //// 0 ~ 24 にマップする
    //auto encode = [index, &base](char a, char b) -> int {
    //    return index(a) * base.size() + index(b);
    //};

    int lastIndex = encode({ 'X', 'X', 'X' });
    // ll dp[110][lastIndex+1];
    vector<vector<ll>> dp(110, vector<ll>(lastIndex + 1, 0));
    dp[0][encode({ 'X', 'X', 'X' })] = 1;

    // XXXXXXX A
    // XXXXXXX C
    // XXXXXXX G
    // XXXXXXX T

    // dp[i][encode(a, b)] = i の長さの文字列で、最後が ab なものの数でかつ、違反文字列ではない
    // dp[i+1][encode(b, c)] += dp[i][encode(a, b)] で、かつ abc が違反文字列ではない

    // AGTC ATGC
    for (int i = 1; i <= N; i++) {
        for (char a : base) {
            for (char b : base) {
                for (char c : base) {
                    for (char d : base) {
                        // We can't add 'X'
                        if (d == 'X')
                            continue;

                        string s;
                        s += a;
                        s += b;
                        s += c;
                        s += d;

                        bool invalid = (s.find("AGC") != string::npos);
                        for (int i = 0; i < 3; i++) {
                            swap(s[i], s[i + 1]);
                            if (s.find("AGC") != string::npos)
                                invalid = true;
                            swap(s[i], s[i + 1]);
                        }
                        if (invalid)
                            continue;

                        //dump(s);

                        dp[i][encode({ b, c, d })] += dp[i - 1][encode({ a, b, c })];
                        dp[i][encode({ b, c, d })] %= MOD;
                    }
                }
            }
        }
    }

    // dp[N][encode(a, b)] = N の長さの文字列で、最後が ab なものの数でかつ、違反文字列ではない
    ll ans = 0;
    for (char a : base) {
        for (char b : base) {
            for (char c : base) {
                ans += dp[N][encode({ a, b, c })];
                ans %= MOD;
            }
        }
    }
    cout << ans << endl;

    return 0;
}

// ----------------------------------------------------------------------------
// Test driver

#ifdef DEBUG
#define MAY_RUN_TESTCASE
#endif

#ifdef MAY_RUN_TESTCASE
#include <fstream>

#if __has_include(<unistd.h>)
// Mac, Linux
#include <unistd.h>
#elif __has_include(<io.h>)
// Windows
#include <io.h>
#else
// Other?
#error "unistd.h or io.h not found"
#endif

bool test_file_exists(const std::string& str)
{
    std::ifstream fs(str);
    return fs.is_open();
}

#endif

int main(int argc, char** argv)
{
#ifndef MAY_RUN_TESTCASE
    return my_main(argc, argv);
#else
    if (argc == 1) {
        return my_main(argc, argv);
    } else if (argc == 2) {

        char* stdin_file = argv[1];
        freopen(stdin_file, "r", stdin);
        return my_main(argc, argv);

    } else if (argc == 5) {

        std::string stdin_file = argv[1];
        std::string expected_file = argv[2];
        std::string stdout_file = argv[3];
        std::string stderr_file = argv[4];

        if (!test_file_exists(stdin_file)) {
            std::cerr << stdin_file << " not found" << std::endl;
            return 3;
        }

        if (!test_file_exists(expected_file)) {
            std::cerr << expected_file << " not found" << std::endl;
            return 3;
        }

        int original_stdin = dup(fileno(stdin));
        int original_stdout = dup(fileno(stdout));
        int original_stderr = dup(fileno(stderr));

        freopen(stdin_file.c_str(), "r", stdin);
        freopen(stdout_file.c_str(), "w", stdout);
        freopen(stderr_file.c_str(), "w", stderr);

        int ret = my_main(argc, argv);

        fflush(stdout);
        fflush(stderr);

        dup2(original_stderr, fileno(stderr));
        dup2(original_stdout, fileno(stdout));
        dup2(original_stdin, fileno(stdin));

        if (ret != 0) {
            std::cerr << "main returns " << ret << std::endl;
            return ret;
        }

        std::ifstream inp(stdin_file);
        std::ifstream out(stdout_file);
        std::ifstream err(stderr_file);
        std::ifstream exp(expected_file);

        // Clear is needed if the file is empty.
        std::cout << "----- input -----" << std::endl;
        std::cout << inp.rdbuf() << std::endl;
        std::cout.clear();
        std::cout << "-----------------" << std::endl
                  << std::endl;

        std::cout << "----- output ----" << std::endl;
        std::cout << out.rdbuf() << std::endl;
        std::cout.clear();
        std::cout << "-----------------" << std::endl
                  << std::endl;

        std::cout << "---- expected ---" << std::endl;
        std::cout << exp.rdbuf() << std::endl;
        std::cout.clear();
        std::cout << "-----------------" << std::endl
                  << std::endl;

        std::cout << "----- stderr ----" << std::endl;
        std::cout << err.rdbuf() << std::endl;
        std::cout.clear();
        std::cout << "-----------------" << std::endl;

        inp.seekg(0);
        out.seekg(0);
        exp.seekg(0);
        err.seekg(0);

        std::string output_str, expected_str;
        {
            std::stringstream output_ss;
            output_ss << out.rdbuf();
            output_str = output_ss.str();

            std::stringstream expected_ss;
            expected_ss << exp.rdbuf();
            expected_str = expected_ss.str();
        }

        // Remove trailing spaces
        output_str.erase(output_str.find_last_not_of(" \n\r\t") + 1);
        expected_str.erase(expected_str.find_last_not_of(" \n\r\t") + 1);

        if (output_str == expected_str)
            return 0;
        else
            return 1;
    }
    return 1;
#endif
}


Measured memory_bytes: 384