#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <vector>
#include <numeric>
#include <cmath>
#include <algorithm>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}

template <class T, class F>
T boundary(F is_ok, T ok, T ng) {
  while (abs(ok - ng) > 1) {
    T m = (ok + ng) / 2;
    (is_ok(m) ? ok : ng) = m;
  }
  return ok;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  Z N;
  cin >> N;
  vector<Z> As(N);
  cin >> As;
  vector<Z> ps(N + 1);
  partial_sum(begin(As), end(As), begin(ps) + 1);
  Z min_diff = INF;
  dump(ps);
  for (Z i = 2; i < N - 1; i++) {
    Z lsum = ix(ps, i), rsum = ix(ps, N) - ix(ps, i);
    Z lcenter = boundary([&] (Z c) { return ix(ps, c) < lsum / 2; }, 1ll, i),
      rcenter = boundary([&] (Z c) { return ix(ps, c) - ix(ps, i) < rsum / 2; }, i + 1, N);
    Z P = ix(ps, lcenter), Q = ix(ps, i) - ix(ps, lcenter),
      R = ix(ps, rcenter) - ix(ps, i), S = ix(ps, N) - ix(ps, rcenter);
    dump(i);
    dump(lcenter);
    dump(rcenter);
    if (lcenter != i - 1 && abs(ix(ps, i) - ix(ps, lcenter + 1) - ix(ps, lcenter + 1)) < abs(P - Q)) {
      lcenter++;
      dump(lcenter);
      P = ix(ps, lcenter);
      Q = ix(ps, i) - ix(ps, lcenter);
    }
    if (rcenter != N - 1 && abs(ix(ps, rcenter + 1) - ix(ps, i) - ix(ps, N) + ix(ps, rcenter + 1)) < abs(R - S)) {
      rcenter++;
      dump(rcenter);
      R = ix(ps, rcenter) - ix(ps, i);
      S = ix(ps, N) - ix(ps, rcenter);
    }
    dump(P);
    dump(Q);
    dump(R);
    dump(S);
    min_diff = min(min_diff, max({P, Q, R, S}) - min({P, Q, R, S}));
  }
  cout << min_diff << endl;
}



Measured memory_bytes: 3456