#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<pair<int,ll>>>;
#define INF 1000000000
#define MOD 998244353
#define MAX 200000

int main(){
  string S;
  cin>>S;
  int N=S.size();
  int cnt=0;
  int sum=0;
  for(int i=0;i<N;i++){
    if(S[i]=='1'){
      cnt++;
      sum+=i+1;
    }
  }
  vector<vector<vector<ll>>> dp(N+1,vector<vector<ll>>(cnt+1,vector<ll>(sum+1,0)));
  dp[0][0][0]=1;
  for(int i=0;i<N;i++){
    for(int j=0;j<=cnt;j++){
      for(int k=0;k<=sum;k++){
        dp[i+1][j][k]+=dp[i][j][k];
        if(j+1<=cnt&&k+(i+1)<=sum){
          dp[i+1][j+1][k+(i+1)]+=dp[i][j][k];
        }
      }
    }
  }
  cout<<dp[N][cnt][sum]<<'\n';
}