#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()

#ifdef LOCAL
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else 
#define dump(x) true
#endif

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

template<class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	os<<"{";
	rep(i, v.size()) {
		if (i) os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

template <unsigned int MOD>
struct ModInt {
	using uint = unsigned int;
	using ull = unsigned long long;
	using M = ModInt;

	uint v;

	ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }
	M& set_norm(uint _v) { //[0, MOD * 2)->[0, MOD)
		v = (_v < MOD) ? _v : _v - MOD;
		return *this;
	}

	explicit operator bool() const { return v != 0; }
	M operator+(const M& a) const { return M().set_norm(v + a.v); }
	M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }
	M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }
	M operator/(const M& a) const { return *this * a.inv(); }
	M& operator+=(const M& a) { return *this = *this + a; }
	M& operator-=(const M& a) { return *this = *this - a; }
	M& operator*=(const M& a) { return *this = *this * a; }
	M& operator/=(const M& a) { return *this = *this / a; }
	M operator-() const { return M() - *this; }
	M& operator++(int) { return *this = *this + 1; }
	M& operator--(int) { return *this = *this - 1; }

	M pow(ll n) const {
		if (n < 0) return inv().pow(-n);
		M x = *this, res = 1;
		while (n) {
			if (n & 1) res *= x;
			x *= x;
			n >>= 1;
		}
		return res;
	}

	M inv() const {
		ll a = v, b = MOD, p = 1, q = 0, t;
		while (b != 0) {
			t = a / b;
			swap(a -= t * b, b);
			swap(p -= t * q, q);
		}
		return M(p);
	}

	bool operator==(const M& a) const { return v == a.v; }
	bool operator!=(const M& a) const { return v != a.v; }
	friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }
	static int get_mod() { return MOD; }	
};

using Mint = ModInt<1000000007>;

const int maxn = 300010;

Mint dp[maxn][3][2][3];//pos, sum, current len, even/odd zero

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

	dp[0][0][0][0] = 1;

	rep(i, n) {
		if (S[i] == '0' || S[i] == '?') { //put 0
			rep(j, 3) rep(k, 2) rep(l, 3) if (dp[i][j][k][l]) {
				int nj = j + 1;
				if (nj == 3) nj = 1;
				dp[i+1][nj][k][l] += dp[i][j][k][l];
			}
		}
		if (S[i] == '1' || S[i] == '?') { //put 1
			rep(j, 3) rep(k, 2) rep(l, 3) if (dp[i][j][k][l]) {
				if (j == 1) { //ignore
					dp[i+1][0][k][l] += dp[i][j][k][l];
				} else if (j == 0) {
					int nl = l;
					if (l == 1 && k == 1) {
						nl = 2;
					}
					if (l == 0 && k == 0) {
						nl = 1;
					}
					dp[i+1][0][k^1][nl] += dp[i][j][k][l];
				} else if (j == 2) {
					dp[i+1][0][k^1][l] += dp[i][j][k][l];
				}
			}
		}
	}

	Mint ans = 0;
	rep(j, 3) rep(k, 2) rep(l, 3) {
		int nl = l;
		if (j == 0 && l == 1 && k == 1) {
			nl = 2;
		}
		if (nl == 2) {
			ans += dp[n][j][k][l];
		}
	}
	cout << ans << endl;

	return 0;
}

Measured memory_bytes: 22020