#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;


long conv( int i)
{
  return static_cast<long>(10 - std::abs(i-9));
}

long numberof(std::vector<int> v)
{
  long answer = 1L;
  if (v.size() == 0) return 1;
  if (v.size() == 1) return conv(v.at(0));
  for (std::vector<int>::iterator it = v.begin(); it != v.end(); it++)
  {
    answer *= conv(*it);
  }
  for (std::vector<int>::iterator it = v.begin()+1; it != v.end(); it++)
  {
    if (*it ==1 && *(it-1)<9)
    {
      std::vector<int> n,m;
      std::copy(it+1, v.end(), back_inserter(m));
      if (std::distance(v.begin(), it) > 1)
        std::copy(v.begin(), it-1, back_inserter(n));
      answer+= conv(10+*(it-1))* numberof(n)* numberof(m);
    }
  }
  return answer;
}



int main()
{
  long liczba;

  cin >> liczba;
  long answer(1);
  std::vector<int> dig_r;
  while (liczba > 0)
  {
    dig_r.push_back(liczba - 10*(liczba/10));
    liczba = liczba /10;
  }

  answer = numberof(dig_r);

  cout << answer << endl;
  return 0;
}