#include <bits/stdc++.h>

using namespace std;

#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)

constexpr int MOD = 1000000007;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template <class T>
string to_string(T s);
template <class S, class T>
string to_string(pair<S, T> p);
string to_string(string s) { return s; }
string to_string(const char s[]) { return to_string(string(s)); }

template <class T>
string to_string(T v) {
  if (v.empty()) return "{}";
  string ret = "{";
  for (auto x : v) ret += to_string(x) + ",";
  ret.back() = '}';
  return ret;
}
template <class S, class T>
string to_string(pair<S, T> p) {
  return "{" + to_string(p.first) + "," + to_string(p.second) + "}";
}

void debug() { cerr << endl; }
template <class Head, class... Tail>
void debug(Head head, Tail... tail) {
  cerr << to_string(head) << " ";
  debug(tail...);
}

struct IO {
#ifdef _WIN32
  inline char getchar_unlocked() { return getchar(); }
  inline void putchar_unlocked(char c) { putchar(c); }
#endif
  string separator = " ";
  template <class T>
  inline void read(T &x) {
    char c;
    do {
      c = getchar_unlocked();
    } while (c != '-' && (c < '0' || '9' < c));
    bool minus = 0;
    if (c == '-') {
      minus = 1;
      c = getchar_unlocked();
    }
    x = 0;
    while ('0' <= c && c <= '9') {
      x *= 10;
      x += c - '0';
      c = getchar_unlocked();
    }
    if (minus) x = -x;
  }
  inline void read(string &x) {
    char c;
    do {
      c = getchar_unlocked();
    } while (c == ' ' || c == '\n');
    x.clear();
    do {
      x += c;
      c = getchar_unlocked();
    } while (c != ' ' && c != '\n' && c != EOF);
  }
  template <class T>
  inline void read(vector<T> &v) {
    for (auto &x : v) read(x);
  }
  template <class Head, class... Tail>
  inline void read(Head &head, Tail &... tail) {
    read(head);
    read(tail...);
  }
  template <class T>
  inline void write(T x) {
    char buf[32];
    int p = 0;
    if (x < 0) {
      x = -x;
      putchar_unlocked('-');
    }
    if (x == 0) putchar_unlocked('0');
    while (x > 0) {
      buf[p++] = (x % 10) + '0';
      x /= 10;
    }
    while (p) {
      putchar_unlocked(buf[--p]);
    }
  }
  inline void write(string x) {
    for (char c : x) putchar_unlocked(c);
  }
  inline void write(const char s[]) {
    for (int i = 0; s[i] != 0; ++i) putchar_unlocked(s[i]);
  }
  template <class T>
  inline void write(vector<T> v) {
    for (auto itr = v.begin(); itr + 1 != v.end(); ++itr) {
      write(*itr);
      write(separator);
    }
    write(v.back());
  }
  template <class Head, class... Tail>
  inline void write(Head head, Tail... tail) {
    write(head);
    write(separator);
    write(tail...);
  }
  void set_separator(string s) { separator = s; }
} io;

int main() {
  int N;
  io.read(N);
  vector<ll> A(N);
  io.read(A);
  vector<ll> accl(N), accr(N);
  accl[0] = A[0];
  accr[0] = A[N - 1];
  REP(i, N - 1) {
    accl[i + 1] = accl[i] + A[i + 1];
    accr[i + 1] = accr[i] + A[N - i - 2];
  }
  ll ans = LLINF;
  FOR(i, 1, N - 2) {
    auto left_sep =
        lower_bound(accl.begin(), accl.begin() + i + 1, (accl[i] + 1) / 2);
    ll left_left = *left_sep;
    ll left_right = accl[i] - left_left;
    vector<Pll> lefts;
    lefts.emplace_back(left_left, left_right);
    if (left_sep != accl.begin()) {
      left_left = *(left_sep - 1);
      left_right = accl[i] - left_left;
      lefts.emplace_back(left_left, left_right);
    }
    auto right_sep = lower_bound(accr.begin(), accr.begin() + N - i - 2 + 1,
                                 (accr[N - i - 2] + 1) / 2);
    ll right_right = *right_sep;
    ll right_left = accr[N - i - 2] - right_right;
    vector<Pll> rights;
    rights.emplace_back(right_left, right_right);
    if (right_sep != accr.begin()) {
      right_right = *(right_sep - 1);
      right_left = accr[N - i - 2] - right_right;
      rights.emplace_back(right_left, right_right);
    }
    for (auto pl : lefts) {
      for (auto pr : rights) {
        ll mx = max({pl.first, pl.second, pr.first, pr.second});
        ll mn = min({pl.first, pl.second, pr.first, pr.second});
        ans = min(ans, mx - mn);
      }
    }
  }
  io.write(ans);
  io.write("\n");
  return 0;
}


Measured memory_bytes: 4992