#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ii pair<ll, ll>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define F0R(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define inf 1000000010
void clean(ii &a, ii &b) {
for (int i = 30; ~i; i--) {
if ((a.f & (1 << i)) && (b.f & (1 << i))) {
a.f ^= (1 << i);
b.f ^= (1 << i);
} else if ((a.s & (1 << i)) && (b.s & (1 << i))) {
a.s ^= (1 << i);
b.s ^= (1 << i);
} else if ((a.f & (1 << i)) || (b.f & (1 << i)) || (a.s & (1 << i)) || (b.s & (1 << i))) {
break;
}
}
}
// true if left, false if up
// second number is distance from that axis
pair<bool, ll> calc(ii x) {
int dir = -1;
ll dist = 0;
for (int i = 30; ~i; i--) {
int curDir = -1;
if (x.f & (1 << i)) {
curDir = 1;
} else if (x.s & (1 << i)) {
curDir = 0;
}
if (dir == -1) dir = curDir;
if (curDir != -1 && curDir != dir) break;
if (curDir != -1) dist += (1 << i);
}
return make_pair(dir, dist);
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int n; cin >> n; assert(n == 2);
ii a, b; cin >> a.f >> a.s >> b.f >> b.s;
clean(a, b);
//cout << a.f << " "<< a.s << " " << b.f << " " << b.s << endl;
pair<bool, ll> res = calc(a), res2 = calc(b);
if (res.f == res2.f) {
cout << a.f + a.s + b.f + b.s - 2*min(res.s, res2.s) << endl;
} else {
cout << a.f + a.s + b.f + b.s << endl;
}
return 0;
}
