#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void ckmax(T& x, T y) {
  x = (y > x ? y : x);
}
template <typename T>
inline void ckmin(T& x, T y) {
  x = (y < x ? y : x);
}
const int MOD = 1e9 + 7;
inline int mod1(int x) { return x < MOD ? x : x - MOD; }
inline int mod2(int x) { return x < 0 ? x + MOD : x; }
inline void add(int& x, int y) { x = mod1(x + y); }
inline void sub(int& x, int y) { x = mod2(x - y); }
const int MAXN = 1e6;
int n, dp[MAXN + 5], dist[MAXN + 5], pos[MAXN + 5], nxt_1[MAXN + 5],
    nxt_d[MAXN + 5];
char s[MAXN + 5];
int main() {
  cin >> (s + 1);
  n = strlen(s + 1);
  int start_pos = 0;
  for (int i = 1; i <= n; ++i) {
    if (s[i] == '1') {
      start_pos = i;
      break;
    }
  }
  if (!start_pos) {
    cout << n << endl;
    return 0;
  }
  for (int i = 1; i <= n; ++i) {
    if (s[i] == '0') {
      dist[i] = dist[i - 1] + 1;
    } else {
      dist[i] = 0;
    }
  }
  for (int i = 0; i <= n + 1; ++i) pos[i] = n + 1;
  for (int i = n; i >= 1; --i) {
    nxt_1[i] = pos[0];
    nxt_d[i] = pos[dist[i] + 1];
    pos[dist[i]] = i;
  }
  dp[start_pos] = start_pos;
  for (int i = start_pos; i < n; ++i) {
    if (nxt_1[i] != n + 1) {
      add(dp[nxt_1[i]], dp[i]);
    }
    if (nxt_d[i] != n + 1) {
      add(dp[nxt_d[i]], dp[i]);
    }
  }
  int ans = 0;
  for (int i = start_pos; i <= n; ++i) {
    if (dist[i] <= dist[n]) {
      add(ans, dp[i]);
    }
  }
  cout << ans << endl;
  return 0;
}
