#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include "./CompetitiveProgrammingCpp/Timer.hpp"
#include "./CompetitiveProgrammingCpp/debug.hpp"
#include "./CompetitiveProgrammingCpp/sample.hpp"
#else
#define dump(...)
template <class T>
inline auto d_val(T a, T b) {
  return a;
}
#endif

/* (=＾o＾=) */
#define int ll

/* macro */
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for (ll i = (ll)(e - 1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x, c) for (const auto& x : (c))
#define REPI2(it, b, e) for (auto it = (b); it != (e); ++it)
#define REPI(it, c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it, c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for (auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(), (x).end()
#define cauto const auto&
/* macro func */
template <class T>
inline auto sort(T& t) {
  std::sort(ALL(t));
}
template <class T>
inline auto rsort(T& t) {
  std::sort((t).rbegin(), (t).rend());
}
template <class T>
inline auto unique(T& t) {
  (t).erase(unique((t).begin(), (t).end()), (t).end());
}
template <class T, class S>
inline auto chmax(T& t, const S& s) {
  if (s > t) {
    t = s;
    return true;
  }
  return false;
}
template <class T, class S>
inline auto chmin(T& t, const S& s) {
  if (s < t) {
    t = s;
    return true;
  }
  return false;
}
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template <class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::bitset;
using std::cin;
using std::list;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::unordered_map;
using std::unordered_multimap;
using std::unordered_multiset;
using std::unordered_set;
using std::vector;

/* constant value */
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;

/* Initial processing  */
struct Preprocessing {
  Preprocessing() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(0);
  };
} _Preprocessing;

/* Remove the source of the bug */
signed pow(signed, signed) {
  assert(false);
  return -1;
}

/* define hash */
namespace std {
template <>
class hash<std::pair<ll, ll>> {
 public:
  size_t operator()(const std::pair<ll, ll>& x) const {
    return hash<ll>()(1000000000 * x.first + x.second);
  }
};
}  // namespace std

/* input */
template <class T>
std::istream& operator>>(std::istream& is, vector<T>& vec) {
  for (T& x : vec) is >> x;
  return is;
}

//=============================================================================================
class CumulativeSum {
  const ll size;
  std::vector<ll> sumList;

 public:
  CumulativeSum() = delete;
  CumulativeSum(const std::vector<ll>& v) : size(v.size()), sumList(size + 1) {
    for (ll i = 0; i < size; ++i) {
      sumList[i + 1] = sumList[i] + v[i];
    }
  }
  ll get(ll n) const { return sumList[n + 1]; }
  ll get(ll l, ll r) const {
    if (r < l) {
      return 0LL;
    }
    l = std::max(l, 0LL);
    r = std::min(r, size - 1);
    return sumList[r + 1] - sumList[l];
  }
};

auto bs(const CumulativeSum& sum, ll l, ll r) {
  ll h = sum.get(l, r) / 2;
  ll ok = r - 1;
  ll ng = l - 1;
  while (ok - ng > 1) {
    ll mid = (ok + ng) / 2;
    bool isOk = (sum.get(l, mid) >= h);
    if (isOk) {
      ok = mid;
    } else {
      ng = mid;
    }
  }
  auto lv = sum.get(l, ok);
  auto rv = sum.get(ok + 1, r);
  auto llv = sum.get(l, ok - 1);
  auto rrv = sum.get(ok, r);
  if (abs(rv - lv) > abs(llv - rrv) && ok - 1 >= l) {
    return ok - 1;
  }
  return ok;
}

signed main() {
  ll n;
  cin >> n;
  VL v(n);
  cin >> v;

  auto sum = CumulativeSum(v);

  ll ans = 1e10;
  FOR(i, 2, n - 1) {
    auto l = bs(sum, 0, i - 1);
    auto r = bs(sum, i, n - 1);
    VL t = {sum.get(0, l), sum.get(l + 1, i - 1), sum.get(i, r),
	    sum.get(r + 1, n - 1)};
    sort(t);
    ll val = t[3] - t[0];

    chmin(ans, val);
  }
  cout << ans << endl;
}


Measured memory_bytes: 3328