class mint:
    def __init__(self, x):
        self.__x = x % md

    def __str__(self):
        return str(self.__x)

    def __add__(self, other):
        if isinstance(other, mint): other = other.__x
        return mint(self.__x + other)

    def __sub__(self, other):
        if isinstance(other, mint): other = other.__x
        return mint(self.__x - other)

    def __rsub__(self, other):
        return mint(other - self.__x)

    def __mul__(self, other):
        if isinstance(other, mint): other = other.__x
        return mint(self.__x * other)

    __radd__ = __add__
    __rmul__ = __mul__

    def __truediv__(self, other):
        if isinstance(other, mint): other = other.__x
        return mint(self.__x * pow(other, md - 2, md))

    def __pow__(self, power, modulo=None):
        return mint(pow(self.__x, power, md))

md = 10**9+7

def main():
    n=int(input())
    #dp[i][j]...i歩進んで最後のケンが連続j回あったときのコース数
    dp=[[0]*3 for _ in range(n+1)]
    dp[0][0]=mint(1)
    for i in range(n):
        for j in range(3):
            pre=dp[i][j]
            if pre==0:continue
            # パのあとだからケンにしか遷移できない
            if j==0:dp[i+1][1]+=pre
            # 1回のケンのあとだから、ケンでもパでもいい
            if j==1:
                dp[i+1][2]+=pre
                dp[i+1][0]+=pre
            # 2回のケンのあとだからパにしか遷移できない
            if j==2:
                dp[i+1][0]+=pre
    print(sum(dp[n]))

main()