#include <iostream>
#include <algorithm>
#include <string>
using namespace std;

long long d[69][2009][69];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	string s; cin >> s;
	int n = 0, m = s.length(), k = 0;
	for (int i = 0; i < s.length(); i++)
		if (s[i] == '1') {
			n++; k += i + 1;
		}
	for (int i = 0; i <= m; i++)
		d[0][0][i] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= k; j++)
			for (int pi = 1; pi <= min(m, j); pi++) 
				d[i][j][pi] = d[i - 1][j - pi][pi - 1];
		for (int j = 1; j <= k; j++)
			for (int pi = 1; pi <= m; pi++)
				d[i][j][pi] += d[i][j][pi - 1];
	}
	cout << d[n][k][m] << '\n';
	return 0;
}