import sys
INF = float('inf')
#10**20,2**63,float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
#from collections import defaultdict
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    P = II()
    N = [1] + [0]*P
    L = len(N)
    Less = [[[0 for _ in range(3)] for _ in range(2)] for _ in range(L + 1)]
    Less[1][1][0] = 1
    Less[1][0][0] = 2
    Less[1][0][1] = 3
    Less[1][0][2] = 3
    Ans = 0
    for i in range(L):
        for n in range(10):
            if n == 3:
                for m in range(3):
                    Less[i+1][1][(m+n)%3] += Less[i][0][m]
                    Less[i+1][1][(m+n)%3] += Less[i][1][m]
            else:
                for m in range(3):
                    Less[i+1][0][(m+n)%3] += Less[i][0][m]
                    Less[i+1][1][(m+n)%3] += Less[i][1][m]
        #print("Less:",Less[i+1])
        Ans += sum(Less[i][1]) + Less[i][0][0]
    # 小さいサンプルでの確認は大事。
    # print("Equ:",Equ)
    # print("Less:",Less)
    print(Ans)
    return
solve()
#sys.setrecursionlimit(10 ** 6)#再帰関数ではコメントにしないこと！！