N = gets.to_i
MOD = 10 ** 9 + 7

A = 0
G = 1
C = 2
T = 3

dp = Array.new(N + 1) { Array.new(4) { Array.new(4) { Array.new(4, 0) } } }

dp[0][T][T][T] = 1
N.times do |n|
  4.times do |c3|
    4.times do |c2|
      4.times do |c1|
        next if dp[n][c1][c2][c3] == 0

        4.times do |c|
          next if c2 == A && c1 == G && c == C
          next if c2 == A && c1 == C && c == G
          next if c2 == G && c1 == A && c == C
          next if c3 == A && c1 == G && c == C
          next if c3 == A && c2 == G && c == C

          dp[n + 1][c][c1][c2] += dp[n][c1][c2][c3]
          dp[n + 1][c][c1][c2] %= MOD
        end
      end
    end
  end
end

ans = 0
4.times do |c3|
  4.times do |c2|
    4.times do |c1|
      ans += dp[N][c1][c2][c3]
      ans %= MOD
    end
  end
end

puts ans