#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

map<vector<int>, ll> ans;

ll solve(int a, int b, int n, int s) {
    if (ans.find({a,b,n,s}) != ans.end()) return ans[{a,b,n,s}];
    if (a > b) {
        ans[{a,b,n,s}] = 0;
        return ans[{a,b,n,s}];
    }
    if (n == 0) {
        if (s == 0) {
            ans[{a,b,n,s}] = 1;
            return ans[{a,b,n,s}];
        } else {
            ans[{a,b,n,s}] = 0;
            return ans[{a,b,n,s}];
        }
    }
    if (n > b - a + 1) {
        ans[{a,b,n,s}] = 0;
        return ans[{a,b,n,s}];
    }
    if (s < a || s > (b + b - n + 1) * n / 2) {
        ans[{a,b,n,s}] = 0;
        return ans[{a,b,n,s}];
    }
    if (n == 1) {
        if (s >= a && s <= b) {
            ans[{a,b,n,s}] = 1;
            return ans[{a,b,n,s}];
        } else {
            ans[{a,b,n,s}] = 0;
            return ans[{a,b,n,s}];
        }
    }
    ll ret = 0;
    for (int i = a; i <= b; i++) {
        ret += solve(i + 1, b, n - 1, s - i);
    }
    //cout << a << " " << b << " " << n << " " << s << " " << ret << endl;;
    ans[{a,b,n,s}] = ret;
    return ret;
}

int main() {
    //rep(i, 0, 60) rep(j, 0, 60) rep(k, 0, 61) rep(l, 0, 1800) ans[i][j][k][l] = -1;
    string S;
    cin >> S;
    int n = S.size(), t = 0, c = 0;
    rep(i, 0, n) {
        if (S[i] == '1') {
            t += i;
            c++;
        }
    }
    //cout << c << " " << t << endl;
    cout << solve(0, n - 1, c, t) << endl;
}