/* -*- coding: utf-8 -*-
 *
 * 1694.cc:  No.1694 ZerOne - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 60;
const int MAX_M = MAX_N * (MAX_N - 1) / 2;

/* typedef */

typedef long long ll;

/* global variables */

char s[MAX_N + 4];
ll dp[MAX_N + 1][MAX_N + 1][MAX_M + 1];

/* subroutines */

/* main */

int main() {
  scanf("%s", s);
  int n = strlen(s);

  int on = 0, m = 0;
  for (int i = 0; i < n; i++) {
    int si = s[i] - '0';
    on += si;
    m += si * i;
  }
  //printf("on=%d, m=%d\n", on, m);

  dp[0][0][0] = 1;

  for (int i = 0; i < n; i++)
    for (int j = 0; j <= on; j++)
      for (int k = 0; k <= m; k++)
	if (dp[i][j][k] > 0) {
	  dp[i + 1][j][k] += dp[i][j][k];
	  if (j < on && k + i <= m)
	    dp[i + 1][j + 1][k + i] += dp[i][j][k];
	}

  printf("%lld\n", dp[n][on][m]);
  return 0;
}