#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 5;
// a[32];
using PII = pair<int, int>;
const int INF = 0x3f3f3f3f3f3f;
map<string, vector<PII>>mp;
map<int, string>mpp;
int a[N];
int ans[N];
int ww[N];
int st[N],top=0;
const int mod = 998244353;
bool cmp(PII a, PII b) {
	return a.first > b.first;
}
bool cmp2(int a, int b) {
	return a > b;
}
int __gcd(int x, int y) {
	if (y == 0)return x;
	else return __gcd(y, x % y);
}
int fp(int a, int x) {
	int ans = 1;
	while (x) {
		if (x & 1)ans *= a;
		ans %= mod;
		a *= a;
		a %= mod;
		x >>= 1;
	}
	return ans%mod;
}


void solve() {
	int x, y; cin >> x >> y;
	int ans = 0;
	if (x == 2 || y == 2) {
		ans = 2 * (3 - x);
	}
	else {
		ans = (2 - x) + 2;
	}
	cout << ans << endl;
}



signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int t=1;
	//cin >> t;
	while (t--)solve();
}