#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
// disable assert
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
using ll = long long;
const ll INF = 1ll << 60;
#define REP(i,n) for(ll i=0; i<ll(n); i++)
template <class T> using V = vector<T>;
template <class A, class B> void chmax(A& l, const B& r){ if(l < r) l = r; }
template <class A, class B> void chmin(A& l, const B& r){ if(r < l) l = r; }

const ll Z = 16;
ll A, B, C;

struct Node {
  ll A[Z][Z] = {};
  ll dest[Z] = {};
};

ll tr(ll a, ll b){
  ll x = a ^ b;
  return a < b && x != A && x != B && x != C;
}

Node add(const Node& v, ll x){
  Node res;
  REP(i,Z-1) res.dest[i] = v.dest[i+1];
  res.dest[Z-1] = x;
  REP(i,Z) REP(j,Z-1) res.A[i][j] = v.A[i][j+1];
  REP(i,Z) REP(j,Z) if(tr(v.dest[j], x)) chmax(res.A[i][Z-1], v.A[i][j] + 1);
  REP(i,Z) REP(j,Z) if(i > res.dest[j]) res.A[i][j] = -INF;
  // REP(i,Z) cout << res.dest[i] << " "; cout << endl;
  // REP(i,Z){ REP(j,Z){ cout << res.A[i][j] << " "; } cout << endl; } cout << endl;
  return res;
}

ll naive(ll N){
  Node X; REP(i,N+1) X = add(X, i);
  ll ans = 0;
  REP(i,Z) REP(j,Z) if(i <= X.dest[j] && X.dest[j] == N) chmax(ans, X.A[i][j]);
  return ans;
}

ll solve(ll N){
  if(N < 16) return naive(N);
  Node X; REP(i,16) X = add(X, i);
  V<Node> buf(61);
  buf[4] = X;
  for(ll i=5; i<buf.size(); i++){
    auto Y = buf[i-1];
    REP(j,Z) Y = add(Y, (1ll << (i-1)) + j);
    REP(j,Z) buf[i].dest[j] = buf[i-1].dest[j] + (1ll << (i-1));
    REP(a,Z) REP(b,Z) REP(c,Z) chmax(buf[i].A[a][c], Y.A[a][b] + buf[i-1].A[b][c]);
  }
  Node Y = X;
  // cout << "i = " << -1 << " , dest = "; for(auto a : Y.dest) cout << a << " "; cout << endl;
  // REP(i,Z){ REP(j,Z){ cout << Y.A[i][j] << " "; } cout << endl; } cout << endl;
  for(ll i=59; i>=4; i--) if(N & (1ll << i)){
    Node nx;
    REP(a,Z) REP(b,Z) REP(c,Z) chmax(nx.A[a][c], Y.A[a][b] + buf[i].A[b][c]);
    REP(j,Z) nx.dest[j] = Y.dest[j] + (buf[i].dest[j] - j);
    Y = nx;
    REP(j,Z) Y = add(Y, Y.dest[Z-1] + 1);
    // cout << "i = " << i << " , dest = "; for(auto a : Y.dest) cout << a << " "; cout << endl;
    // REP(i,Z){ REP(j,Z){ cout << Y.A[i][j] << " "; } cout << endl; } cout << endl;
  }
  ll ans = 0;
  REP(i,Z) REP(j,Z) if(i <= Y.dest[j] && Y.dest[j] == N) chmax(ans, Y.A[i][j]);
  return ans;
}

void testcase(){
  ll N; cin >> N >> A >> B >> C;
  cout << solve(N) << "\n";
  // cout << naive(N) << "\n";
}

int main(){
  cin.tie(0)->sync_with_stdio(0);
  // ll T; cin >> T; REP(t,T)
  testcase();
  return 0;
}