#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const long double PI = 3.14159265;
long long int powerWithMod(long long int base, long long int exponent,
                           long long int modulus = LLONG_MAX) {
  long long int result = 1;
  base %= modulus;
  while (exponent > 0) {
    if (exponent % 2 == 1) result = (result * base) % modulus;
    exponent >>= 1;
    base = (base * base) % modulus;
  }
  return result;
}
long long int modInverse(long long int a, long long int m = MOD) {
  return powerWithMod(a, m - 2, m);
}
int n;
string a;
long long int dp[1234567][5];
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> a;
  n = a.size();
  if (a[0] == '?') {
    dp[1][0] = 1;
    dp[1][3] = 1;
    dp[1][4] = 1;
  } else if (a[0] == '1')
    dp[1][4] = 1;
  else if (a[0] == '*')
    dp[1][3] = 1;
  else if (a[0] == '0')
    dp[1][0] = 1;
  for (int i = 2; i <= n; i++) {
    if (a[i - 1] == '?' or a[i - 1] == '0')
      dp[i][0] = (dp[i - 1][0] + dp[i - 1][1]) % MOD;
    if (a[i - 1] == '?' or a[i - 1] == '1') dp[i][1] = (dp[i - 1][3]) % MOD;
    if (a[i - 1] == '?' or a[i - 1] == '2') dp[i][2] = (dp[i - 1][3]) % MOD;
    if (a[i - 1] == '?' or a[i - 1] == '*')
      dp[i][3] = (dp[i - 1][2] + dp[i - 1][3] + dp[i - 1][4]) % MOD;
    if (a[i - 1] == '?' or a[i - 1] == '1')
      dp[i][4] = (dp[i - 1][0] + dp[i - 1][1]) % MOD;
  }
  cout << (dp[n][0] + dp[n][1] + dp[n][3]) % MOD << "\n";
  return 0;
}
