#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

template<int mod>
struct ModInt{
    int x;

    ModInt() : x(0) {}
    
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    
    ModInt &operator+=(const ModInt &p){
        if((x += p.x) >= mod)   x -= mod;
        return *this;
    }
    
    ModInt &operator-=(const ModInt &p){
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p){
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }

    ModInt &operator/=(const ModInt &p){
        *this *= p.inverse();
        return *this;
    }
    
    ModInt operator-() const {return ModInt(-x);}

    ModInt operator+(const ModInt &p) const {return ModInt(*this) += p;}

    ModInt operator-(const ModInt &p) const {return ModInt(*this) -= p;}

    ModInt operator*(const ModInt &p) const {return ModInt(*this) *= p;}

    ModInt operator/(const ModInt &p) const {return ModInt(*this) /= p;}

    bool operator==(const ModInt &p) const {return x == p.x;}

    bool operator!=(const ModInt &p) const {return x != p.x;}

    ModInt inverse() const{
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0){
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(int64_t n) const{
        ModInt ret(1), mul(x);
        while(n > 0){
            if(n & 1)   ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const ModInt &p){
        return os << p.x;
    }

    friend istream &operator>>(istream &is, ModInt &a){
        int64_t t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }

    static int get_mod() {return mod;}
};

using modint = ModInt<mod>;

modint dp[105][4][4][4];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    // TTT
    dp[0][0][0][0] = 1;
    for(int i = 0; i < n; ++i){
        for(int x = 0; x < 4; ++x){
            for(int y = 0; y < 4; ++y){
                for(int z = 0; z < 4; ++z){
                    if(dp[i][x][y][z] == 0) continue;
                    // cout << i << ' ' << x << ' ' << y << ' ' << z << ' ' << dp[i][x][y][z] << '\n';
                    if(x == 2){
                        // xAG or AxG
                        if(y == 1 || z == 1){
                            for(int j = 0; j < 3; ++j){
                                dp[i + 1][j][x][y] += dp[i][x][y][z];
                            }
                        }
                        else{
                            for(int j = 0; j < 4; ++j){
                                dp[i + 1][j][x][y] += dp[i][x][y][z];
                            }
                        }
                    }
                    // xAC
                    else if(x == 3 && y == 1){
                        for(int j = 0; j < 4; ++j){
                            if(j == 2)  continue;
                            dp[i + 1][j][x][y] += dp[i][x][y][z];
                        }
                    }
                    // xGA
                    else if(x == 1 && y == 2){
                        for(int j = 0; j < 3; ++j){
                            dp[i + 1][j][x][y] += dp[i][x][y][z];
                        }
                    }
                    // AGx
                    else if(y == 2 && z == 1){
                        for(int j = 0; j < 3; ++j){
                            dp[i + 1][j][x][y] += dp[i][x][y][z];
                        }
                    }
                    else{
                        for(int j = 0; j < 4; ++j){
                            dp[i + 1][j][x][y] += dp[i][x][y][z];
                        }
                    }
                }
            }
        }
        // modint sum = 0;
        // for(int x = 0; x < 4; ++x){
        //     for(int y = 0; y < 4; ++y){
        //         for(int z = 0; z < 4; ++z){
        //             sum += dp[i + 1][x][y][z];
        //         }
        //     }
        // }
        // cout << sum << endl;
    }
    modint ans = 0;
    for(int i = 0; i < 4; ++i){
        for(int j = 0; j < 4; ++j){
            for(int k = 0; k < 4; ++k){
                ans += dp[n][i][j][k];
            }
        }
    }
    cout << ans << endl;
}

Measured memory_bytes: 256