#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}

template <unsigned int mod>
class ModInt {
private:
    unsigned int v;
    static unsigned int norm(const unsigned int& x){ return x < mod ? x : x - mod; }
    static ModInt make(const unsigned int& x){ ModInt m; return m.v = x, m; }
    static ModInt inv(const ModInt& x){ return make(inverse(x.v, mod)); }
    static unsigned int inverse(int a, int m){
        int u[] = {a, 1, 0}, v[] = {m, 0, 1}, t;
        while(*v){
            t = *u / *v;
            swap(u[0] -= t * v[0], v[0]), swap(u[1] -= t * v[1], v[1]), swap(u[2] -= t * v[2], v[2]);
        }
        return (u[1] % m + m) % m;
    }

public:
    ModInt() : v{0}{}
    ModInt(const long long val) : v{norm(val % mod + mod)} {}
    ModInt(const ModInt<mod>& n) : v{n()} {}
    explicit operator bool() const noexcept { return v != 0; }
    bool operator!() const noexcept { return !static_cast<bool>(*this); }
    ModInt& operator=(const ModInt& n){ return v = n(), (*this); }
    ModInt& operator=(const long long val){ return v = norm(val % mod + mod), (*this); }
    ModInt operator+() const { return *this; }
    ModInt operator-() const { return v == 0 ? make(0) : make(mod - v); }
    ModInt operator+(const ModInt& val) const { return make(norm(v + val())); }
    ModInt operator-(const ModInt& val) const { return make(norm(v + mod - val())); }
    ModInt operator*(const ModInt& val) const { return make((long long)v * val() % mod); }
    ModInt operator/(const ModInt& val) const { return *this * inv(val); }
    ModInt& operator+=(const ModInt& val){ return *this = *this + val; }
    ModInt& operator-=(const ModInt& val){ return *this = *this - val; }
    ModInt& operator*=(const ModInt& val){ return *this = *this * val; }
    ModInt& operator/=(const ModInt& val){ return *this = *this / val; }
    ModInt operator+(const long long val) const { return ModInt{v + val}; }
    ModInt operator-(const long long val) const { return ModInt{v - val}; }
    ModInt operator*(const long long val) const { return ModInt{(long long)v * (val % mod)}; }
    ModInt operator/(const long long val) const { return ModInt{(long long)v * inv(val)}; }
    ModInt& operator+=(const long long val){ return *this = *this + val; }
    ModInt& operator-=(const long long val){ return *this = *this - val; }
    ModInt& operator*=(const long long val){ return *this = *this * val; }
    ModInt& operator/=(const long long val){ return *this = *this / val; }
    bool operator==(const ModInt& val) const { return v == val.v; }
    bool operator!=(const ModInt& val) const { return !(*this == val); }
    bool operator==(const long long val) const { return v == norm(val % mod + mod); }
    bool operator!=(const long long val) const { return !(*this == val); }
    unsigned int operator()() const { return v; }
    friend ModInt operator+(const long long val, const ModInt& n) { return n + val; }
    friend ModInt operator-(const long long val, const ModInt& n) { return ModInt{val - n()}; }
    friend ModInt operator*(const long long val, const ModInt& n) { return n * val; }
    friend ModInt operator/(const long long val, const ModInt& n) { return ModInt{val} / n; }
    friend bool operator==(const long long val, const ModInt& n) { return n == val; }
    friend bool operator!=(const long long val, const ModInt& n) { return !(val == n); }
    friend istream& operator>>(istream& is, ModInt& n){
        unsigned int v;
        return is >> v, n = v, is;
    }
    friend ostream& operator<<(ostream& os, const ModInt& n){ return (os << n()); }
    friend ModInt mod_pow(ModInt x, long long n){
        ModInt ans = 1;
        while(n){
            if(n & 1) ans *= x;
            x *= x, n >>= 1;
        }
        return ans;
    }
};
#define MOD 1000000007
using mod = ModInt<MOD>;


mod dp[300000][4];
vector<mod> calc(string s){
    int n = s.size();
    rep(i,n){
        rep(j,4){
            dp[i][j] = 0;
        }
    }
    vector<mod> res(n);
    if(s[0]=='0'){
        dp[0][0] = 1;
    }else if(s[0]=='1'){
        res[0] = 1;
    }else{
        dp[0][0] = 1;
        res[0] = 1;
    }
    for(int i=1;i<n;i++){
        if(i%2==1){
            if(s[i]=='0'){
                dp[i][0] += dp[i-1][0];
            }else if(s[i]=='1'){
                dp[i][1] += dp[i-1][0];
            }else{
                dp[i][0] += dp[i-1][0];
                dp[i][1] += dp[i-1][0];
            }
        }else{
            if(s[i]=='0'){
                dp[i][0] += dp[i-1][0]+dp[i-1][1];
            }else if(s[i]=='1'){
                dp[i][0] += dp[i-1][0];
                res[i] += dp[i-1][1];
            }else{
                dp[i][0] += dp[i-1][0]+dp[i-1][1];
                dp[i][0] += dp[i-1][0];
                res[i] += dp[i-1][1];
            }
        }
        // cerr  << dp[i][0] << " " << dp[i][1] << " " << dp[i][2] << " " << dp[i][3] << endl;
    }
    return res;
}


int main(){
    string s;
    cin >> s;
    int n = s.size();
    if(n==1&&s[0]=='?'){
        cout << 1 << endl;
        return 0;
    }
    vector<mod> c(n);
    rep(i,n){
        if(i!=0&&s[i]=='?'){
            c[i] = 2;
        }else{
            c[i] = 1;
        }
    }
    vector<mod> a = calc(s);
    reverse(all(s));
    vector<mod> b = calc(s);
    reverse(all(b));
    for(int i=1;i<n;i++){
        c[i] *= c[i-1];
        
    }
    // cerr << "a: ";
    // rep(i,n){
    //     cerr << a[i] << " ";
    // }
    // cerr << endl;
    // cerr << "b: ";
    // rep(i,n){
    //     cerr << b[i] << " ";
    // }
    // cerr << endl;
    // cerr << "c: "; 
    // rep(i,n){
    //     cerr << c[i] << " ";
    // }
    // cerr << endl;
    vector<mod>sb(n);
    for(int i=1;i<n;i++){
        sb[i] = b[i]*c[i-1];
    }
    for(int i=n-2;i>=1;i--){
        sb[i] += sb[i+1];
    }
    // cerr << "s: ";
    // rep(i,n){
    //     cerr << sb[i] << " ";
    // }
    // cerr << endl;
    mod inv = 1;
    mod sm = 0;
    for(int i=0;i<n;i++){
        sm += a[i] * sb[i+1]*inv + a[i]*b[i]; 
        if(c[i+1]!=0){
           inv =(mod)1/c[i+1]; 
        }
    }
    // sm += a[n-1] + b[0];
    cout << sm << endl;
    return 0;
}

Measured memory_bytes: 10196