#include <bits/stdc++.h>
using namespace std;
const long long sz = 2e5 + 5, mod = 1e9 + 7;
long long t, n, m, k, q;
const long long inf = 3e18;
long long dx[] = {1, 0, -1, 0};
long long dy[] = {0, 1, 0, -1};
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  t = 1;
  while (t--) {
    string s;
    cin >> s;
    long long n = (long long)s.size();
    long long beg = 0, end = n;
    while (beg < end && s[beg] == '0') {
      ++beg;
    }
    while (beg < end && s[end - 1] == '0') {
      --end;
    }
    if (beg == end) {
      cout << n << '\n';
      return 0;
    }
    vector<long long> aux(n + 1);
    long long sum_aux = 0;
    vector<long long> dp(n);
    long long ones = 0;
    long long zeros = 0;
    long long sum_for_ones = 0;
    for (long long i = end - 1; i >= beg; i--) {
      if (s[i] == '0') {
        ++zeros;
        sum_aux -= aux[zeros];
        sum_aux += mod;
        sum_aux %= mod;
        aux[zeros] = dp[i + zeros];
        sum_aux += aux[zeros];
        sum_aux %= mod;
        dp[i] = dp[i + 1];
        continue;
      }
      sum_for_ones += sum_aux;
      sum_for_ones %= mod;
      zeros = 0;
      ++ones;
      dp[i] = ones + sum_for_ones;
      dp[i] %= mod;
    }
    long long ans = dp[beg] * (beg + 1);
    ans %= mod;
    ans *= (n - end + 1);
    ans %= mod;
    cout << ans;
    return 0;
  }
  return 0;
}
