#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=1e6,Mod=1e9+7;

inline int Pow(int x,int y)
{
    int res=1;
    while(y)
    {
        if(y&1) res=1ll*res*x%Mod;
        x=1ll*x*x%Mod,y>>=1;
    }
    return res;
}

int fac[Maxn+5],inv[Maxn+5],n; string s;

inline void Solve()
{
    n=s.size(),s=' '+s;
    int f[2]={1,0};
    For(i,1,n)
    {
        int k=1ll*fac[n-1]*inv[i-1]%Mod*inv[n-i]%Mod;
        if(k%2==0)
        {
            f[0]=(1ll+(s[i]=='?'))*f[0]%Mod;
            f[1]=(1ll+(s[i]=='?'))*f[1]%Mod;
        }
        else
        {
            int g0=0,g1=0;
            if(s[i]!='1') (g0+=f[0])%=Mod,(g1+=f[1])%=Mod;
            if(s[i]!='0') (g1+=f[0])%=Mod,(g0+=f[1])%=Mod;
            f[0]=g0,f[1]=g1;
        }
    } cout<<f[1]<<endl;
}

int main()
{
    // freopen("1.in","r",stdin);

    fac[0]=inv[0]=1;
    For(i,1,Maxn) fac[i]=1ll*fac[i-1]*i%Mod;
    inv[Maxn]=Pow(fac[Maxn],Mod-2);
    Rof(i,Maxn-1,1) inv[i]=1ll*inv[i+1]*(i+1)%Mod;
    while(cin>>s) Solve();
    return 0;
}