Koa the Koala has a binary string s of length n. Koa can perform no more than n-1 (possibly zero) operations of the following form:

In one operation Koa selects positions i and i+1 for some i with 1 ≤ i < |s| and sets s_i to max(s_i, s_{i+1}). Then Koa deletes position i+1 from s (after the removal, the remaining parts are concatenated).

Note that after every operation the length of s decreases by 1.

How many different binary strings can Koa obtain by doing no more than n-1 (possibly zero) operations modulo 10^9+7 (1000000007)?

Input

The only line of input contains binary string s (1 ≤ |s| ≤ 10^6). For all i (1 ≤ i ≤ |s|) s_i = 0 or s_i = 1.

Output

On a single line print the answer to the problem modulo 10^9+7 (1000000007).

Examples

Input


000


Output


3


Input


0101


Output


6


Input


0001111


Output


16


Input


00101100011100


Output


477

Note

In the first sample Koa can obtain binary strings: 0, 00 and 000.

In the second sample Koa can obtain binary strings: 1, 01, 11, 011, 101 and 0101. For example:

  * to obtain 01 from 0101 Koa can operate as follows: 0101 → 0(10)1 → 011 → 0(11) → 01. 
  * to obtain 11 from 0101 Koa can operate as follows: 0101 → (01)01 → 101 → 1(01) → 11. 



Parentheses denote the two positions Koa selected in each operation.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int C = 1000001, M = 1000000007;
int seq[C];
ll past_summa[C], exact[C], elems[C];
int main() {
  string s;
  int m, left, right, i, j, n = 0, cur = 0, proper = 0;
  ll res = 0, valid, cur_summa, past;
  cin >> s;
  m = s.size();
  for (i = 0; i < m && s[i] == '0'; i++)
    ;
  if (i == m) {
    printf("%d\n", m);
    return 0;
  }
  left = i;
  for (i = m - 1; i >= 0 && s[i] == '0'; i--)
    ;
  right = i;
  for (i = left + 1; i <= right; i++) {
    if (s[i] == '0')
      cur++;
    else
      seq[n] = cur, cur = 0, n++;
  }
  seq[n] = 0, n++;
  proper = 0, exact[0] = 1, elems[0] = 0;
  for (i = n - 2; i >= 0; i--) {
    valid = seq[i] + 1;
    cur_summa = 0;
    past = 0;
    for (j = proper; j >= 0; j--) {
      if (valid == 0) break;
      cur_summa = (cur_summa + valid * exact[j] +
                   (((seq[i] - elems[j]) > (0)) ? (seq[i] - elems[j]) : (0)) *
                       past_summa[j]) %
                  M;
      if (elems[j] <= seq[i])
        past = (past + past_summa[j] + exact[j]) % M;
      else
        break;
      valid = seq[i] - elems[j];
    }
    elems[j + 1] = seq[i];
    exact[j + 1] = cur_summa % M;
    past_summa[j + 1] = past % M;
    proper = j + 1;
  }
  for (i = 0; i <= proper; i++) res = (res + exact[i] + past_summa[i]) % M;
  printf("%lld\n", (1ll * ((1ll * (left + 1) * (m - right)) % M) * res) % M);
  return 0;
}
