#include <bits/stdc++.h>
using namespace std;
int nxt[1000100][2];
long long way[1000100];
const int mod = 1000000007;
signed main() {
  std::ios::sync_with_stdio(false);
  string s;
  cin >> s;
  int n = s.size();
  int a1 = 0, a2 = 0;
  for (int i = 0; i < n; ++i) {
    if (s[i] == '0')
      ++a1;
    else {
      break;
    }
  }
  for (int i = n - 1; i >= 0; --i) {
    if (s[i] == '0')
      ++a2;
    else {
      break;
    }
  }
  if (a1 == s.size()) {
    cout << n << '\n';
    return 0;
  }
  s = s.substr(a1, n - a1 - a2);
  n = s.size();
  for (int i = n - 1; i >= 0; --i) {
    for (char c = 0; c <= 1; ++c)
      if (s[i] == c + '0')
        nxt[i][c] = i + 1;
      else
        nxt[i][c] = nxt[i + 1][c];
  }
  vector<pair<int, int>> v;
  int t = 0, q = s.size() - 1;
  for (int i = s.size() - 1; i >= 0; --i) {
    if (s[i] == '0') {
      q = i;
      ++t;
    } else if (t) {
      while (v.size() && v.back().second <= t) v.pop_back();
      if (v.size())
        nxt[q + t][0] = v.back().first + t + 1;
      else
        nxt[q + t][0] = 0;
      v.push_back({q, t});
      t = 0;
    }
  }
  long long ans = 0;
  way[1] = 1;
  for (int i = 0; i <= n; ++i) {
    if (nxt[i][0]) (way[nxt[i][0]] += way[i]) %= mod;
    if (nxt[i][1]) (way[nxt[i][1]] += way[i]) %= mod;
    if (s[i - 1] == '1') (ans += way[i]) %= mod;
  }
  cout << ans * (a1 + 1) % mod * (a2 + 1) % mod << '\n';
  return 0;
}
