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[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => int.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = ReadLine();
        var mod = 1_000_000_007;
        var dp = new long[18];
        var m2 = new int[] { 0, 0, 1, 0, 2, 0, 1, 0, 2, 0 };
        var m5 = new int[] { 0, 0, 0, 0, 0, 1, 0, 0, 0, 0 };
        dp[0] = 1;
        for (var i = 1; i < n[0] - '0'; ++i) ++dp[m5[i] * 3 + m2[i]];
        ++dp[9 + m5[n[0] - '0'] * 3 + m2[n[0] - '0']];
        for (var i = 1; i < n.Length; ++i)
        {
            var ndp = new long[18];
            ndp[0] = 1;
            for (var j = 0; j < 9; ++j) for (var k = 1; k <= 9; ++k)
            {
                var n5 = Math.Min(2, j / 3 + m5[k]);
                var n2 = Math.Min(2, j % 3 + m2[k]);
                ndp[n5 * 3 + n2] = (ndp[n5 * 3 + n2] + dp[j]) % mod;
            }
            for (var j = 0; j < 9; ++j) if (dp[j + 9] == 1) for (var k = 1; k < n[i] - '0'; ++k)
            {
                var n5 = Math.Min(2, j / 3 + m5[k]);
                var n2 = Math.Min(2, j % 3 + m2[k]);
                ndp[n5 * 3 + n2] = (ndp[n5 * 3 + n2] + dp[j + 9]) % mod;
            }
            for (var j = 0; j < 9; ++j) if (dp[j + 9] == 1 && n[i] > '0')
            {
                var n5 = Math.Min(2, j / 3 + m5[n[i] - '0']);
                var n2 = Math.Min(2, j % 3 + m2[n[i] - '0']);
                ndp[9 + n5 * 3 + n2] = 1;
            }
            dp = ndp;
        }
        WriteLine((dp[8] + dp[17]) % mod);
    }
}