Problem link - https://www.spoj.com/problems/ANARC05H/

#include <bits/stdc++.h>
using namespace std;
#define MAXN 30
int prefix[MAXN];
string input;
int size, sum, ans;
class fastio {
public:
    fastio() {
        ios_base::sync_with_stdio(false);
        cout.tie(nullptr);
        cin.tie(nullptr);
    }
} __fastio;
void prefix_sum(int n) {
    prefix[0] = input[0] - '0';
    for(int i=1; i<n; i++) {
        prefix[i] = prefix[i-1] + (input[i] - '0');
    }
}
int f(int i, int p) {
    if(i == size - 1) return 1;
    ans = sum = 0;
    for(int k=i; k<size; ++k) {
        sum = prefix[k] - prefix[i];
        if(sum >= p) {
            ans += f(k, sum);
        }
    }
    return ans;
}
void solve() {
    cin >> input;
    size = input.length();
    prefix_sum(size);
    cout << f(0,0) << endl;
}
int main() {
  __fastio;
  solve();
  return 0;
}