#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
const long long mod = 1000000007ll;
int n, num[N], cnt = 0;
char str[N];
void init() {
  int prv = -1;
  for (int i = 0; i < n; i++) {
    if (str[i] == '1') {
      num[++cnt] = i - prv - 1;
      prv = i;
    }
  }
  num[++cnt] = n - prv - 1;
}
long long f[N], sgt_tag[N << 2], sgt_val[N << 2];
void build(int l, int r, int now) {
  int mid = l + r >> 1;
  sgt_tag[now] = -1ll;
  sgt_val[now] = 0ll;
  if (l < r) build(l, mid, now << 1), build(mid + 1, r, now << 1 | 1);
}
void cover(int l, int r, int now, long long val) {
  sgt_tag[now] = val;
  sgt_val[now] = 1ll * val * (r - l + 1) % mod;
}
void pushdown(int l, int r, int now) {
  int mid = l + r >> 1;
  if (sgt_tag[now] >= 0) {
    cover(l, mid, now << 1, sgt_tag[now]);
    cover(mid + 1, r, now << 1 | 1, sgt_tag[now]);
    sgt_tag[now] = -1;
  }
}
void pushup(int now) {
  sgt_val[now] = (sgt_val[now << 1] + sgt_val[now << 1 | 1]) % mod;
}
void change(int left, int right, int l, int r, int now, long long val) {
  int mid = l + r >> 1;
  if (l == left && r == right)
    cover(l, r, now, val);
  else {
    pushdown(l, r, now);
    if (right <= mid)
      change(left, right, l, mid, now << 1, val);
    else if (left > mid)
      change(left, right, mid + 1, r, now << 1 | 1, val);
    else
      change(left, mid, l, mid, now << 1, val),
          change(mid + 1, right, mid + 1, r, now << 1 | 1, val);
    pushup(now);
  }
}
void solve() {
  f[cnt + 1] = 0ll;
  build(0, n + 1, 1);
  long long now = 0ll;
  for (int i = cnt; i >= 1; i--) {
    change(0, num[i], 0, n + 1, 1, f[i + 1]);
    if (i == 1) {
      if (cnt > 1)
        f[i] = f[i + 1] * (num[i] + 1) % mod;
      else
        f[i] = num[i];
    } else
      f[i] = (sgt_val[1] + num[cnt] + 1) % mod;
  }
  printf("%lld\n", f[1]);
}
int main() {
  scanf("%s", str), n = strlen(str);
  init();
  solve();
  return 0;
}
