#include <bits/stdc++.h>
using namespace std;
using i64 = long long; 
constexpr int mod = 1e9 + 7;
int add(int a, int b) {
	return a += b, a < mod ? a : a - mod;
}
int sub(int a, int b) {
	return a -= b, a >= 0 ? a : a + mod;
}
int mul(int a, int b) {
	return 1ull * a * b % mod;
}
int qpow(int a, i64 b) {
	int c = 1;
	while (b) {
		if (b & 1) {
			c = mul(c, a);
		}
		a = mul(a, a);
		b >>= 1;
	}
	return c;
}
int inv(int x) {
	return qpow(x, mod - 2);
}
bool comb(int n, int m) {
	return (n & m) == m;
}
void solve(string s) {
	int n = s.size();
	vector<int> pos;
	int ans = 1;
	for (int i = 0; i < n; i++) {
		if (comb(n - 1, i) == 0) {
			if (s[i] == '?') {
				ans = mul(ans, 2);
			}
		} else {
			pos.push_back(i);
		}
	}
	int m = pos.size();
	vector<int> f{1, 0};
	for (int i = 0; i < m; i++) {
		char c = s[pos[i]];
		vector<int> g = f;
		if (c == '0') {
			
		} else if (c == '1') {
			swap(g[0], g[1]);
		} else if (c == '?') {
			g[0] = add(g[0], f[1]);
			g[1] = add(g[1], f[0]);
		}
		swap(f, g);
	}
	ans = mul(ans, f[1]);
	cout << ans << "\n";
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	string s;
	while (cin >> s) {
		solve(s);
	}
	return 0;
}