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 \le 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 \le |s| \le 10^6$). For all $i$ ($1 \le i \le |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 \rightarrow 0(10)1 \rightarrow 011 \rightarrow 0(11) \rightarrow 01$.  to obtain $11$ from $0101$ Koa can operate as follows: $0101 \rightarrow (01)01 \rightarrow 101 \rightarrow 1(01) \rightarrow 11$. 

Parentheses denote the two positions Koa selected in each operation.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'from itertools import groupby\n\ns=input()\nn=len(s)\ns=[s[i] for i in range(n)]\nmod=10**9+7\n\ndata=groupby(s)\ndata=[(key,len(list(group))) for key,group in data]\nStart=1\nEnd=1\nif data[0][0]=="0":\n    Start+=data[0][1]\n    data=data[1:]\nif not data:\n    print(Start-1)\n    return\n\nif data[-1][0]=="0":\n    End+=data[-1][1]\n    data.pop()\n\ncomp=[0]*len(data)\nfor i in range(len(data)):\n    comp[i]=data[i][1]\n\nn=len(comp)\nif n==1:\n    print(comp[0]*Start*End)\n    return\n\nodd=[comp[i] for i in range(n) if i%2==1]\nN=len(odd)\nN0 = 2**(N-1).bit_length()\ndata = [None]*(2*N0)\nINF = (-1, 0)\n# 区間[l, r+1)の値をvに書き換える\n# vは(t, value)という値にする (新しい値ほどtは大きくなる)\ndef update(l, r, v):\n    L = l + N0; R = r + N0\n    while L < R:\n        if R & 1:\n            R -= 1\n            data[R-1] = v\n\n        if L & 1:\n            data[L-1] = v\n            L += 1\n        L >>= 1; R >>= 1\n# a_iの現在の値を取得\ndef _query(k):\n    k += N0-1\n    s = INF\n    while k >= 0:\n        if data[k]:\n            s = max(s, data[k])\n        k = (k - 1) // 2\n    return s\n# これを呼び出す\ndef query(k):\n    return _query(k)[1]\n\nID=[-1]*n\nfor i in range(N):\n    start=0\n    end=N\n    while end-start>1:\n        test=(end+start)//2\n        if query(test)>=odd[i]:\n            start=test\n        else:\n            end=test\n    #print(i,start,odd[i])\n    if start!=0:\n        ID[2*i+1]=start\n        update(start+1,i+1,(i,odd[i]))\n    else:\n        if query(0)>=odd[i]:\n            ID[2*i+1]=start\n            update(start+1,i+1,(i,odd[i]))\n        else:\n            ID[2*i+1]=-1\n            update(0,i+1,(i,odd[i]))\n\n\n\ndp=[0]*n\ndp[0]=comp[0]\npre=[0]*n\nfor i in range(2,n,2):\n    id=ID[i-1]\n    if id==-1:\n        res=comp[i-1]*dp[i-2]\n        pre[i-1]=res\n        #prel[i-1]=1\n    else:\n        j=2*id+1\n        #res=(comp[i-1]*dp[i-2]+(comp[j]-comp[i-1])*premono[j])%mod\n        res=(comp[i-1]*dp[i-2]+pre[j]-comp[i-1]*dp[j-1])%mod\n        pre[i-1]=res\n        #prel[i-1]=prel[j]+1\n    dp[i]=(comp[i]*res+dp[i-2]+comp[i])%mod\n#print(pre)\n#print(dp)\nprint((dp[-1]*Start*End)%mod)\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: