import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

def move(i, j):
    for di in [-3, 3]:
        yield i+di, j
        yield i, j+di
        for dj in [-2, 2]:
            yield i+di, j+dj
            yield i+dj, j+di

n = II()
m = 6*n+1
if n < 10:
    ij = [(3*n, 3*n)]
    for _ in range(n):
        nij = set()
        for i, j in ij:
            for ni, nj in move(i, j):
                nij.add((ni, nj))
        ij = nij
    ans = len(ij)

elif n & 1:
    ans = m**2//2
    n2 = n//2
    ans -= n2*(n2+1)*4
else:
    ans = m**2//2+1-(n//2)**2*4

print(ans%md)