import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int root(int[] uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));
}
bool connect(int[] uf, int u, int v) {
  u = uf.root(u);
  v = uf.root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


void exper() {
  foreach (N; 1 .. 10 + 1) {
    auto uf = new int[1 << N];
    uf[] = -1;
    foreach (u; 0 .. 1 << N) {
      foreach (l0; 0 .. N + 1) foreach (r0; l0 + 1 .. N + 1) foreach (l1; r0 .. N + 1) foreach (r1; l1 + 1 .. N + 1) {
        const u0 = (u & ((1<<r0) - (1<<l0))) >> l0;
        const u1 = (u & ((1<<r1) - (1<<l1))) >> l1;
        if (r0 - l0 == r1 - l1 && popcnt(u0) == popcnt(u1)) {
          int v = u;
          v ^= (u0 ^ u1) << l0;
          v ^= (u0 ^ u1) << l1;
          uf.connect(u, v);
        }
      }
    }
    auto uss = new int[][1 << N];
    foreach (u; 0 .. 1 << N) uss[uf.root(u)] ~= u;
    foreach (k; 0 .. N + 1) {
      foreach (r; 0 .. 1 << N) if (popcnt(r) == k && uf[r] < 0) {
        int sum;
        foreach (i; 0 .. N) if (r >> i & 1) sum += i;
        writef("%2d %2d ", k, sum);
        foreach (u; uss[r]) {
          foreach (i; 0 .. N) write(u >> i & 1);
          write(" ");
        }
        writeln;
      }
    }
  }
}

void main() {
//  exper; return;
  
  try {
    for (; ; ) {
      const S = readToken;
      const N = cast(int)(S.length);
      
      int K, L;
      foreach (i; 0 .. N) if (S[i] == '1') {
        K += 1;
        L += i;
      }
      
      // qbinom(N, K) q^(K(K-1)/2)
      const M = N*(N-1)/2;
      auto fs = new long[M + 1];
      fs[0] += 1;
      foreach (i; N - K + 1 .. N + 1) {
        foreach_reverse (j; i .. M + 1) fs[j] -= fs[j - i];
      }
      foreach (i; 1 .. K + 1) {
        foreach (j; i .. M + 1) fs[j] += fs[j - i];
      }
      debug writeln(fs);
      
      writeln(fs[L - K*(K-1)/2]);
    }
  } catch (EOFException e) {
  }
}