#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

int main() {
    string s; cin >> s;
    int n = size(s);
    int m = n * (n + 1) / 2;

    int sum = 0;
    for (int i = 0; i < n; ++i) {
        sum += (s[i] - '0') * (i + 1);
    }

    auto dp = vec<int64_t>(0, n + 1, n + 1, m + 1);

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

    cout << dp[n][count(begin(s), end(s), '1')][sum] << endl;
}