#include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <limits>
#include <stdexcept>
#include <vector>

// lib/quo.hpp
#ifndef QUO_H
#define QUO_H

/*
a == tools:quo(a, b) * b + tools::mod(a, b)
0 <= tools::mod(a, b) < std::abs(b)
*/

namespace tools {
  template <typename T>
  constexpr T quo(const T lhs, const T rhs) {
    return lhs > 0 ? lhs / rhs : rhs > 0 ? -((-lhs - 1 + rhs) / rhs) : (-lhs - 1 + -rhs) / -rhs;
  }
}

#endif

// lib/square.hpp
#ifndef SQUARE_HPP
#define SQUARE_HPP

/*
usage:

tools::square(5) => 25
*/

namespace tools {
  template <typename T>
  constexpr T square(const T x) {
    return x * x;
  }
}

#endif

// lib/is_prime.hpp
#ifndef IS_PRIME_H
#define IS_PRIME_H


/*
usage:

static_assert(tools::is_prime(P), "P must be prime.");
*/

// Source: Stack Overflow ( https://stackoverflow.com/questions/18303632/compile-time-prime-checking/18306693#18306693 )
// Author: Casey ( https://stackoverflow.com/users/923854/casey )
// CC BY-SA 3.0
namespace tools {
  namespace detail {
    namespace is_prime {
      constexpr std::uint_fast32_t mid(const std::uint_fast32_t low, const std::uint_fast32_t high) {
        return (low + high) / 2;
      }

      // precondition: low*low <= n, high*high > n.
      constexpr std::uint_fast32_t ceilsqrt(const std::uint_fast32_t n, const std::uint_fast32_t low, const std::uint_fast32_t high) {
        return low + 1 >= high
          ? high
          : (mid(low, high) * mid(low, high) == n)
          ? mid(low, high)
          : (mid(low, high) * mid(low, high) <  n)
          ? ceilsqrt(n, mid(low, high), high)
          : ceilsqrt(n, low, mid(low, high));
      }

      // returns ceiling(sqrt(n))
      constexpr std::uint_fast32_t ceilsqrt(const std::uint_fast32_t n) {
        return n < 3
          ? n
          : ceilsqrt(n, 1, std::uint_fast32_t(1) << (std::numeric_limits<std::uint_fast32_t>::digits / 2));
      }

      // returns true if n is divisible by an odd integer in
      // [2 * low + 1, 2 * high + 1).
      constexpr bool find_factor(const std::uint_fast32_t n, const std::uint_fast32_t low, const std::uint_fast32_t high) {
        return low + 1 >= high
          ? (n % (2 * low + 1)) == 0
          : (find_factor(n, low, mid(low, high)) || find_factor(n, mid(low, high), high));
      }
    }
  }

  constexpr bool is_prime(const std::uint_fast32_t n) {
    return n > 1
      && (n == 2
        || (n % 2 == 1
          && (n == 3
            || !detail::is_prime::find_factor(n, 1, (detail::is_prime::ceilsqrt(n) + 1) / 2))));
  }
}

#endif

// lib/util.hpp
#ifndef UTIL_HPP
#define UTIL_HPP


typedef std::int_fast64_t i64;
typedef std::uint_fast64_t u64;
typedef std::int_fast32_t i32;
typedef std::uint_fast32_t u32;

namespace tools {
  template <typename T>
  void read(std::vector<T>& vector, const typename std::vector<T>::size_type size) {
    vector.reserve(size);
    std::copy_n(std::istream_iterator<T>(std::cin), size, std::back_inserter(vector));
  }

  template <typename T, std::size_t N>
  void read(std::array<T, N>& array) {
    std::copy_n(std::istream_iterator<T>(std::cin), N, array.begin());
  }
}

#endif

// lib/mod.hpp
#ifndef MOD_HPP
#define MOD_HPP


/*
a == tools:quo(a, b) * b + tools::mod(a, b)
0 <= tools::mod(a, b) < std::abs(b)
*/

namespace tools {
  template <typename T>
  constexpr T mod(const T lhs, const T rhs) {
    return lhs - quo(lhs, rhs) * rhs;
  }
}

#endif

// lib/int_mod.hpp
#ifndef INT_MOD_HPP
#define INT_MOD_HPP


/*
usage:

constexpr const std::uint_fast32_t p = 3;
tools::int_mod<p>(5) + tools::int_mod<p>(4) // => 0
*/

namespace tools {
  template <std::uint_fast32_t P>
  class int_mod {
    static_assert(is_prime(P), "P must be prime.");

  private:
    std::uint_fast32_t m_value;

    constexpr static std::uint_fast32_t add_impl(const std::uint_fast32_t lhs, const std::uint_fast32_t rhs) {
      return lhs + rhs - (lhs + rhs >= P ? P : 0u);
    }

    constexpr static std::uint_fast32_t sub_impl(const std::uint_fast32_t lhs, const std::uint_fast32_t rhs) {
      return lhs - rhs + (lhs < rhs ? P : 0u);
    }

    constexpr static std::uint_fast32_t mul_impl(const std::uint_fast32_t lhs, const std::uint_fast32_t rhs) {
      return static_cast<std::uint_fast32_t>(static_cast<std::uint_fast64_t>(lhs) * static_cast<std::uint_fast64_t>(rhs) % static_cast<std::uint_fast64_t>(P));
    }

    constexpr int_mod<P> pow_impl(const std::uint_fast32_t exponent) const {
      return exponent == 0u
        ? int_mod<P>(1)
        : exponent % 2u == 0u
          ? square(this->pow_impl(exponent / 2u))
          : this->pow_impl(exponent - 1u) * *this;
    }

  public:
    int_mod() :
      m_value(0) {
    }

    int_mod(const std::int_fast32_t value) :
      m_value(static_cast<std::uint_fast32_t>(mod(value, static_cast<std::int_fast32_t>(P)))) {
    }

    int_mod(const int_mod<P>& other) :
      int_mod(other.m_value) {
    }

    constexpr operator std::uint_fast32_t() const {
      return this->m_value;
    }

    constexpr friend int_mod<P> operator+(const int_mod<P>& lhs, const int_mod<P>& rhs) {
      return int_mod<P>(int_mod<P>::add_impl(lhs.m_value, rhs.m_value));
    }

    int_mod<P>& operator+=(const int_mod<P>& other) {
      this->m_value = int_mod<P>::add_impl(this->m_value, other.m_value);
      return *this;
    }

    int_mod<P>& operator++() {
      this->m_value = int_mod<P>::add_impl(this->m_value, 1u);
      return *this;
    }

    int_mod<P> operator++(int) {
      int_mod<P> prev(*this);
      ++this;
      return prev;
    }

    constexpr friend int_mod<P> operator-(const int_mod<P>& lhs, const int_mod<P>& rhs) {
      return int_mod<P>(int_mod<P>::sub_impl(lhs.m_value, rhs.m_value));
    }

    int_mod<P>& operator-=(const int_mod<P>& other) {
      this->m_value = int_mod<P>::sub_impl(this->m_value, other.m_value);
      return *this;
    }

    int_mod<P>& operator--() {
      this->m_value = int_mod<P>::sub_impl(this->m_value, 1u);
      return *this;
    }

    int_mod<P> operator--(int) {
      int_mod<P> prev(*this);
      --this;
      return prev;
    }

    constexpr friend int_mod<P> operator*(const int_mod<P>& lhs, const int_mod<P>& rhs) {
      return int_mod<P>(int_mod<P>::mul_impl(lhs.m_value, rhs.m_value));
    }

    int_mod<P>& operator*=(const int_mod<P>& other) {
      this->m_value = int_mod<P>::mul_impl(this->m_value, other.m_value);
      return *this;
    }

    constexpr int_mod<P> inv() const {
      return this->m_value > 0u
        ? this->pow_impl(P - 2u)
        : (throw std::invalid_argument("cannot divide by zero"));
    }

    constexpr int_mod<P> pow(const std::int_fast32_t exponent) const {
      return exponent >= 0
        ? this->pow_impl(static_cast<std::uint_fast32_t>(exponent))
        : this->pow_impl(static_cast<std::uint_fast32_t>(-exponent)).inv();
    }

    constexpr friend int_mod<P> operator/(const int_mod<P>& lhs, const int_mod<P>& rhs) {
      return lhs * rhs.inv();
    }

    int_mod<P>& operator/=(const int_mod<P>& other) {
      this->m_value = int_mod<P>::mul_impl(this->m_value, other.inv().m_value);
      return *this;
    }
  };
}

#endif

// main.cpp

constexpr u32 P = 1000000007;
constexpr i64 A = 0;
constexpr i64 C = 1;
constexpr i64 G = 2;
constexpr i64 T = 3;

typedef std::array<std::array<tools::int_mod<P>, 64>, 64> matrix;

matrix operator*(const matrix& lhs, const matrix& rhs) {
  matrix product;
  for (i64 i = 0; i < 64; ++i) {
    for (i64 j = 0; j < 64; ++j) {
      product[i][j] = tools::int_mod<P>(0);
      for (i64 k = 0; k < 64; ++k) {
        product[i][j] += lhs[i][k] * rhs[k][j];
      }
    }
  }
  return product;
}

matrix pow(const matrix& base, const i64 exponent) {
  if (exponent == 0) {
    matrix unit;
    for (i64 i = 0; i < 64; ++i) {
      for (i64 j = 0; j < 64; ++j) {
        unit[i][j] = tools::int_mod<P>(i == j ? 1 : 0);
      }
    }
    return unit;
  } else if (exponent % 2 == 0) {
    const matrix squared_result = pow(base, exponent / 2);
    return squared_result * squared_result;
  } else {
    return pow(base, exponent - 1) * base;
  }
}

int main() {
  i64 N;
  std::cin >> N;

  if (N == 3) {
    std::cout << 61 << std::endl;
    return 0;
  }

  matrix unit_matrix;
  for (i64 from = 0; from < 64; ++from) {
    std::fill(unit_matrix[from].begin(), unit_matrix[from].end(), tools::int_mod<P>(0));
    const std::array<i64, 3> state = {(from >> 4) & 3, (from >> 2) & 3, from & 3};
    std::unordered_set<i64> options({A, C, G, T});
    if (state[0] == A && state[1] == G && state[2] == C) options.clear();
    if (state[0] == G && state[1] == A && state[2] == C) options.clear();
    if (state[0] == A && state[1] == C && state[2] == G) options.clear();
    if (state[1] == A && state[2] == G) options.erase(C);
    if (state[1] == G && state[2] == A) options.erase(C);
    if (state[1] == A && state[2] == C) options.erase(G);
    if (state[0] == A && state[2] == G) options.erase(C);
    if (state[0] == A && state[1] == G) options.erase(C);
    for (const i64& option : options) {
      const i64 to = ((from << 2) | option) & 63;
      unit_matrix[from][to] = tools::int_mod<P>(1);
    }
  }

  const matrix matrix = pow(unit_matrix, N - 3);
  tools::int_mod<P> answer(0);
  for (i64 i = 0; i < 64; ++i) {
    for (i64 j = 0; j < 64; ++j) {
      answer += matrix[i][j];
    }
  }

  std::cout << static_cast<u32>(answer) << std::endl;
  return 0;
}

Measured memory_bytes: 768