using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    static long[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => long.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var mod = 1_000_000_007;
        var rev = 166_666_668;
        var n = long.Parse(ReadLine());
        var a = new long[1][] { new long[] { 1, 0, 0, 0, 0, 0 } };
        for (var i = 1; i < 6; ++i)
        {
            var bitmax = 1;
            for (var j = 0; j < i; ++j) bitmax *= 6;
            for (var j = 0; j < bitmax; ++j)
            {
                var tmp = j;
                var cur = 0;
                var flg = false;
                for (var k = 0; k < i; ++k)
                {
                    cur += tmp % 6 + 1;
                    if (cur == i) flg = true;
                    tmp /= 6;
                }
                if (flg) ++a[0][i];
            }
            for (var j = 0; j < i; ++j) a[0][i] = a[0][i] * rev % mod;
        }
        if (n < 6)
        {
            WriteLine(a[0][n]);
            return;
        }
        var x = new long[6][]
        {
            new long[] { 0, 0, 0, 0, 0, rev },
            new long[] { 1, 0, 0, 0, 0, rev },
            new long[] { 0, 1, 0, 0, 0, rev },
            new long[] { 0, 0, 1, 0, 0, rev },
            new long[] { 0, 0, 0, 1, 0, rev },
            new long[] { 0, 0, 0, 0, 1, rev },
        };
        var b = Matrix.Mul(a, Matrix.Pow(x, n - 5));
        WriteLine(b[0][5]);
    }
    class Matrix
    {
        static int mod = 1_000_000_007;
        // 行列の累乗
        public static long[][] Pow(long[][] m, long k)
        {
            var multi = m;
            var r = new long[m.Length][];
            for (var i = 0; i < m.Length; ++i)
            {
                r[i] = new long[m.Length];
                r[i][i] = 1;
            }
            while (k > 0)
            {
                if ((k & 1) == 1) r = Mul(r, multi);
                multi = Mul(multi, multi);
                k >>= 1;
            }
            return r;
        }
        // 行列の積
        public static long[][] Mul(long[][] x, long[][] y)
        {
            var r = new long[x.Length][];
            for (var i = 0; i < x.Length; ++i) r[i] = new long[y[0].Length];
            for (var i = 0; i < x.Length; ++i) for (var k = 0; k < x[0].Length; ++k)
            {
                for (var j = 0; j < y[0].Length; ++j) r[i][j] = (r[i][j] + x[i][k] * y[k][j]) % mod;
            }
            return r;
        }
    }
}