#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)
template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

using mint = atcoder::modint998244353;

void solve() {
	ll n, a, b, c;
	cin >> n >> a >> b >> c;
	if (b > c) swap(b, c);
	if (a > c) swap(a, c);
	if (a > b) swap(a, b);
	if (a % 2 == 0 && b % 2 == 0) {
		cout << n << '\n';
		return;
	}
	ll ans = n;
	rep(i, 1, 60) {
		ll d = (1LL << i) - 1;
		if (d == a || d == b || d == c) {
			ans -= (n >> i) + ((n >> (i - 1)) & 1);
		}
	}
	cout << ans << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	int t = 1;
	// cin >> t;
	while (t--) solve();
}