def greedy(N):
    from itertools import permutations
    sum=0; cnt=0
    for P in permutations(range(N)):
        cnt+=1
        for i in range(N-1):
            sum+=abs(P[i+1]-P[i])
        sum+=abs(P[0]-P[-1])
    return sum,cnt

N=int(input())

Mod=10**9+7
three_inv=pow(3,Mod-2,Mod)
print(N*(N+1)*three_inv%Mod)