import sys
# import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import string
import functools
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
# pypyjit.set_param('max_unroll_recursion=-1')


def readints(): return map(int, input().split())
def readlist(): return list(map(int, input().split()))
def readstr(): return input()[:-1]


class Matpow:
    def __init__(self, A, mod, digit=60):
        self.A = A
        self.N = len(A)
        self.mod = mod
        self.digit = digit
        self.doubling = [None] * self.digit

        self.doubling[0] = A
        for i in range(1, self.digit):
            self.doubling[i] = self.mul(self.doubling[i - 1], self.doubling[i - 1])

    def pow(self, n):
        E = [[1 if i == j else 0 for j in range(self.N)] for i in range(self.N)]
        acc = E
        for k in range(self.digit):
            if n & (1 << k):
                acc = self.mul(acc, self.doubling[k])
        return acc

    def mul(self, A, B):
        C = [[0 for _ in range(self.N)] for _ in range(self.N)]
        for i in range(self.N):
            for j in range(self.N):
                for k in range(self.N):
                    C[i][j] += A[i][k] * B[k][j]
                    C[i][j] %= self.mod
        return C


N = int(input())
mod = 10 ** 9 + 7

pinv = pow(6, mod - 2, mod)
A = [[0 for _ in range(6)] for _ in range(6)]
for j in range(6):
    A[0][j] = pinv
for i in range(1, 6):
    A[i][i - 1] = 1

An = Matpow(A, mod).pow(N)
print(An[0][0])