#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using ll = long long;


constexpr ll options(const ll n)
{
  if (n < 10) return n + 1;
  else return std::max(19 - n, 0ll);
}


ll solve(std::string const& num_str)
{
  std::vector<ll> number(num_str.size());
  std::transform(std::begin(num_str), std::end(num_str),
                 std::begin(number), 
                 [](char x) -> ll { return x - '0'; });

  std::vector<ll> partial(number.size() + 1, 0);
  partial[0] = 1;
  partial[1] = options(number[0]);

  for (int i = 1; i < number.size(); ++i) {
    ll nx = number[i - 1] * 10 + number[i];
    partial[i + 1] = options(number[i]) * partial[i]
                   + (nx >= 10 ? options(nx) * partial[i - 1] : 0);
  }

  return partial.back();
}



int main()
{
  std::ios::sync_with_stdio(false);

  std::string number;
  std::cin >> number;

  std::cout << solve(number) << std::endl;
  return 0;
}