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.
from itertools import groupby

s=input()
n=len(s)
s=[s[i] for i in range(n)]
mod=10**9+7

data=groupby(s)
data=[(key,len(list(group))) for key,group in data]
Start=1
End=1
if data[0][0]=="0":
    Start+=data[0][1]
    data=data[1:]
if not data:
    print(Start-1)
    exit()

if data[-1][0]=="0":
    End+=data[-1][1]
    data.pop()

comp=[0]*len(data)
for i in range(len(data)):
    comp[i]=data[i][1]

n=len(comp)
if n==1:
    print(comp[0]*Start*End)
    exit()

odd=[(comp[i],i//2) for i in range(n) if i%2==1]
#print(odd)
N=len(odd)
ID=[-1]*n
stack=[]
for i in range(N):
    while stack and stack[-1][0]<odd[i][0]:
        stack.pop()
    if stack:
        ID[2*i+1]=stack[-1][1]
    stack.append(odd[i])

#print(ID[1::2])
dp=[0]*n
dp[0]=comp[0]
pre=[0]*n
for i in range(2,n,2):
    id=ID[i-1]
    if id==-1:
        res=comp[i-1]*dp[i-2]
        pre[i-1]=res
        #prel[i-1]=1
    else:
        j=2*id+1
        #res=(comp[i-1]*dp[i-2]+(comp[j]-comp[i-1])*premono[j])%mod
        res=(comp[i-1]*dp[i-2]+pre[j]-comp[i-1]*dp[j-1])%mod
        pre[i-1]=res
        #prel[i-1]=prel[j]+1
    dp[i]=(comp[i]*res+dp[i-2]+comp[i])%mod
#print(pre)
#print(dp)
print((dp[-1]*Start*End)%mod)
