#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip>
using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

ll isKadomatsu(ll a, ll b, ll c) {
	vector<ll> v;
	v.pb(a); v.pb(b); v.pb(c);
	sort(all(v));
	if (v[0] == b || v[2] == b)return 1;
	return 0;
}

long long ston(string s) {
	long long n;
	sscanf(s.c_str(), "%lld", &n);
	return n;
}

int main() {
	vector<string> v(3, string());
	cin >> v[0] >> v[1] >> v[2];
	ll a[2] = {1, 4};
	rep(t, 0, 2) {
		ll d[3];
		rep(i, 0, v.sz) {
			if (v[i] == "?") {
				d[i] = a[t];
			}
			else {
				d[i] = ston(v[i]);
			}
		}
		if (isKadomatsu(d[0], d[1], d[2]) == 1)cout << a[t];
	}
	return 0;
}