#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

string S;
ll from[121][3601];
ll to[121][3601];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>S;
	vector<int> V;
	V.push_back(0);
	FORR(c,S) {
		if(c=='1') V.push_back(0);
		else V.back()++;
	}
	
	from[60][1800]=1;
	FORR(v,V) {
		ZERO(to);
		FOR(x,121) FOR(y,3601) if(from[x][y]) {
			// right
			FOR(i,61) {
				if(i>x-60+v) continue;
				to[60+i][y+i]+=from[x][y];
			}
			// left
			FOR(i,61) if(i) {
				if(x-60+v+i<0) continue;
				if(y-i<0) continue;
				to[60-i][y-i]+=from[x][y];
			}
		}
		swap(from,to);
	}
	cout<<from[60][1800]<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}