#include <bits/stdc++.h>
 
//#include <unistd.h>
//#include <iostream>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
//#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

signed main() {
	string s;
	cin >> s;
	int n = s.size();

	vector<vector<vll>> dp(n, vector<vll>(2, vll(3, vl(3))));
	if (s[0] == '0') dp[0][0][1][0] = 1;
	else if (s[0] == '1') dp[0][1][0][0] = 1;
	else {
		dp[0][0][1][0] = 1;
		dp[0][1][0][0] = 1;
	}

	rep1 (i, n - 1) {
		rep (j, 2) {
			rep (k, 3) {
				rep (l, 3) {
					if (s[i] == '0') {
						int nk;
						if (k == 0) nk = 1;
						else if (k == 1) nk = 2;
						else if (k == 2) nk = 1;
						(dp[i][j][nk][l] += dp[i - 1][j][k][l]) %= MOD;
					}
					else if (s[i] == '1') {
						int nk, nl;
						if (k <= 1) {
							nk = 0;
							if (k == 0) nl = min(l + 1, 2);
							else nl = l;
						}
						else {
							nk = 1;
							nl = l;
						}
						(dp[i][j][nk][nl] += dp[i - 1][j][k][l]) %= MOD;
					}
					else {
						int nk, nl;
						if (k <= 1) {
							nk = 0;
							if (k == 0) nl = min(l + 1, 2);
							else nl = l;
						}
						else {
							nk = 1;
							nl = l;
						}
						(dp[i][j][nk][nl] += dp[i - 1][j][k][l]) %= MOD;

						if (k == 0) nk = 1;
						else if (k == 1) nk = 2;
						else if (k == 2) nk = 1;
						(dp[i][j][nk][l] += dp[i - 1][j][k][l]) %= MOD;
					}
				}
			}
		}
	}

	ll ans = 0;
	rep (j, 2) {
		rep (k, 3) {
			rep (l, 3) {
				if (l == 2) {
					(ans += dp[n - 1][j][k][l]) %= MOD;
					continue;
				}
				int b = 0, w = 0, nn = n;
				b += l;
				nn -= l;
				w += k;
				nn -= k;
				if (j == 0) {
					b += nn / 2;
					w += nn - nn / 2;
				}
				else {
					w += nn / 2;
					b += nn - nn / 2;
				}
				if (b > w) {
					vi temp = {j, k, l};
					//DEBUG_VEC(temp);
					(ans += dp[n - 1][j][k][l]) %= MOD;
				}
			}
		}
	}
	cout << ans << endl;
}

Measured memory_bytes: 129412