#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<ctime>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0)

const double EPS = 1e-18;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
//using mint = modint998244353;

int dh[] = {-1,1,0,0};
int dw[] = {0,0,1,-1};

ll dp[66][66][4000];

int main(){
    string s; cin >> s;
    int n = (int)s.size();
    int rev = 0;
    int cnt1 = 0;
    rep(i,n){
        if(s[i] == '0') rev += cnt1;
        else cnt1++;
    }
    dp[0][0][0] = 1;
    rep(i,n)rep(j,n+1)rep(k,4000){
        if(k-j >= 0) dp[i+1][j][k] += dp[i][j][k-j];
        if(j-1 >= 0) dp[i+1][j][k] += dp[i][j-1][k];
    }
    cout << dp[n][cnt1][rev] << endl;
}