#pragma GCC optimize(2)

#pragma GCC optimize(3)

#pragma GCC optimize(4)

#include<bits/stdc++.h>

using namespace std;

#define y1 y11

#define fi first

#define se second

#define pi acos(-1.0)

#define LL long long

//#define mp make_pair

#define pb push_back

#define ls rt<<1, l, m

#define rs rt<<1|1, m+1, r

#define ULL unsigned LL

#define pll pair<LL, LL>

#define pli pair<LL, int>

#define pii pair<int, int>

#define piii pair<pii, int>

#define pdd pair<double, double>

#define mem(a, b) memset(a, b, sizeof(a))

#define debug(x) cerr << #x << " = " << x << "\n";

#define fio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

//head

const int N = 2e3 + ;

const int MOD = ;

char s[N];

int dp[N*][N*];

int sum[N], sm[N];

int main() {

    int n;

    scanf("%s", s+);

    n = strlen(s+);

    for (int i = ; i <= n; ++i) sum[i] = sum[i-] + s[i]-'';

    dp[][] = ;

    for (int i = ; i <= *n; ++i) {

        int p = min(i, n);

        for (int j = ; j < i; j++) {

            if(sum[p] > j) dp[i][j+] = (dp[i][j+] + dp[i-][j]) % MOD;

            if(*i - sum[p] > i--j) dp[i][j] = (dp[i][j] + dp[i-][j]) % MOD;

        }

    }

    printf("%d\n", dp[*n][sum[n]]);

    return ;

}