#include<bits/stdc++.h>
#define forn(i,s,t) for(register int i=(s); i<=(t); ++i)
#define form(i,s,t) for(register int i=(s); i>=(t); --i)
#define rep(i,s,t) for(register int i=(s); i<(t); ++i)
using namespace std;
typedef long long i64;
const int N = 63;
char s[N]; int n, S, C; i64 dp[2][N][N * N];
int main() {
	scanf("%s", s + 1);
	n = strlen(s + 1);
	forn(i,1,n) S += i * (s[i] == '1'), C += (s[i] == '1');
	int cur = 0;
	dp[0][0][0] = 1;
	forn(i,1,n) {
		cur ^= 1;
		forn(j,0,C) forn(k,0,S) {
			if(j && k >= i) dp[cur][j][k] += dp[cur ^ 1][j - 1][k - i];
			dp[cur][j][k] += dp[cur ^ 1][j][k];
		}
		forn(j,0,C) forn(k,0,S) dp[cur ^ 1][j][k] = 0;
	}
	printf("%lld\n", dp[cur][C][S]);
	return 0;
}