#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

int string_to_int(string s) {
	stringstream ss;
	ss << s;
	int tmp = 0;
	ss >> tmp;
	return tmp;
}
string int_to_string(int x){
	stringstream ss;
	ss<<x;

	return ss.str();
}

int a[3];
int b[3];

int main() {

	string tmp;

	for (int i = 0; i < 3; i++) {
		cin >> tmp;
		if (tmp != "?") {
			int num = string_to_int(tmp);
			a[i] = num;
			b[i] = num;
		}else {
			a[i] = 1;
			b[i] =4;
		}
	}

	string ans ="";

	if(a[0]<a[1]&& a[1]>a[2] || a[0]>a[1]&& a[1]<a[2]){
		ans ="1";
	}
	if (b[0]<b[1] && b[1]>b[2] || b[0]>b[1] && b[1]<b[2]) {
		ans +="4";
	}

	cout<<ans<<endl;



	return 0;
}