N = gets.to_s.chomp
L = N.size
MOD = 10 ** 9 + 7
A = [0, 0, 1, 0, 2, 0, 1, 0, 3, 0, 0]
B = [0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]

ans = 0
dp0 = Array.new(L + 1) { Array.new(3) { Array.new(3, 0) } }
dp1 = Array.new(L + 1) { Array.new(3) { Array.new(3, 0) } }
ans = 0
dp0[0][0][0] = 1

L.times do |i|
  v = N[i].to_i
  d = (i == 0) ? v : 9

  0.upto(2) do |a|
    0.upto(2) do |b|
      d.downto(1) do |n|
        if a == 2 && b == 2
          if n == v
            dp0[i + 1][a][b] += dp0[i][a][b]
          elsif n < v
            dp1[i + 1][a][b] += dp0[i][a][b]
          end

          dp1[i + 1][a][b] += dp1[i][a][b]
        else
          na = a + A[n]
          nb = b + B[n]
          na = 2 if na > 2
          nb = 2 if nb > 2

          if n == v
            dp0[i + 1][na][nb] += dp0[i][a][b]
            dp0[i + 1][na][nb] %= MOD
          elsif n < v
            dp1[i + 1][na][nb] += dp0[i][a][b]
          end

          dp1[i + 1][na][nb] += dp1[i][a][b]
          dp1[i + 1][na][nb] %= MOD
        end
      end
    end
  end

  dp1[i + 1][0][0] += 1
end

puts (dp0[L][2][2] + dp1[L][2][2]) % MOD