#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

bool check(ll a, ll b, ll c){
  if(b==max({a, b, c})||b==min({a, b, c})) return true;
  return false;
}
int main(int argc, char const *argv[]) {
  vector<char> v(3);re(i, 3) std::cin >> v[i];
  ll num = -1;
  for(int i=0;i<3;i++) if(v[i]=='?') num = i;
  bool f, g;
  if(num==0){
    f = check(1, v[1] - '0' , v[2] - '0');
    g = check(4, v[1] - '0' , v[2] - '0');
  }else if(num==1){
    f = check(v[0]-'0', 1 , v[2] - '0');
    g = check(v[0]-'0', 4 , v[2] - '0');
  }else{
    f = check(v[0]-'0', v[1]- '0', 1);
    g = check(v[0]-'0', v[1]-'0' , 4);
  }

  if(f&&g) std::cout << "14" << '\n';
  else if(f) std::cout << "1" << '\n';
  else if(g) std::cout << "4" << '\n';
}