#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

signed main(){
    string S;cin>>S;
    int N=(int)S.size();

    int K=0;
    vector<int> P;
    rep(i,N)if(S[i]=='1') P.push_back(i);
    K=(int)P.size();


    const int T=3000;
    const int geta=T/2;
    vector<vector<vector<ll>>> dp(N+1,vector<vector<ll>>(K+1,vector<ll>(T*2,0)));
    dp[0][0][geta]=1;

    rep(i,N){
        rep(j,K+1){
            rep(k,T*2){
                // okanai
                dp[i+1][j][k]+=dp[i][j][k];
                // oku
                if(j<K) dp[i+1][j+1][k+P[j]-i]+=dp[i][j][k];
            }
        }
    }
    cout<<dp[N][K][geta]<<endl;
    return 0;
}