#include <bits/stdc++.h>
using namespace std;
constexpr long double m_pi = 3.1415926535897932L;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 61;
constexpr long double EPS = 1e-10;
template <typename T>
using vector2 = vector<vector<T>>;
template <typename T>
using vector3 = vector<vector2<T>>;
long long dp[1010101];
int main() {
  ios::sync_with_stdio(false);
  std::cin.tie(0);
  std::cout.tie(0);
  string s;
  cin >> s;
  long long n = s.size();
  vector<long long> cnt(n + 1, 0);
  for (int i = n - 1; i >= 0; i--)
    if (s[i] == '0') cnt[i] = (i == n - 1 ? 0 : cnt[i + 1]) + 1;
  vector<long long> last(n + 2, -1);
  vector<long long> num(n, 0);
  for (long long(i) = (long long)(0); i < (long long)(n); i++)
    if (s[i] == '0') num[i] = (i == 0 ? 0 : num[i - 1]) + 1;
  vector<long long> nxt(n, -1);
  for (int i = n - 1; i >= 0; i--) {
    nxt[i] = last[num[i] + 1];
    last[num[i]] = i;
  }
  dp[cnt[0]] = 1;
  for (long long(i) = (long long)(0); i < (long long)(n); i++) {
    (dp[i + 1 + cnt[i + 1]] += dp[i]) %= MOD;
    if (nxt[i] != -1) (dp[nxt[i]] += dp[i]) %= MOD;
  }
  if (cnt[0] == n) {
    cout << n << "\n";
    return 0;
  }
  long long ans = 0;
  long long mx = num[n - 1];
  for (long long(i) = (long long)(cnt[0]); i < (long long)(n); i++) {
    if (s[i] != '0')
      (ans += dp[i]) %= MOD;
    else if (num[i] <= mx)
      (ans += dp[i]) %= MOD;
  }
  cout << ans * (cnt[0] + 1) % MOD << "\n";
  return 0;
}
