5
27468 7465 74275 40573 40155
112071 76270 244461 264202 132397
1 777133331
2 107454154
3 652330694
4 792720519
 5
78188 56310 79021 70050 65217
115040 5149 128449 98357 36580
1 451393770
2 574046602
3 590130784
4 112514248
 7
1 1 1 1 1 1 1
1 3000000000 3000000000 3000000000 1000000000 1000000000 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
 10
2 8 6 1 2 7 6 9 2 8
4 9 4 3 5 2 9 3 7 3
1 8
2 8
3 8
4 10
5 1
6 4
7 3
8 10
9 2
 11
1 1 1 1 1 1 1 1 1 1 1
1 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
 5
2 1 1 2 3
1 2 2 2 1
1 2
1 3
2 4
1 4

NO
 NO
 NO
 YES
 NO
 NO

#include <bits/stdc++.h>
using namespace std;
int a[5010];
long long pre[5010], premax[5010], sufmax[5010];
int main() {
  int n, id1, id2, id3;
  long long ans, rec;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  pre[0] = 0;
  for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i];
  premax[0] = 0;
  for (int i = 1; i <= n; i++) premax[i] = max(premax[i - 1], pre[i]);
  sufmax[n] = pre[n];
  for (int i = n - 1; i >= 0; i--) sufmax[i] = max(sufmax[i + 1], pre[i]);
  ans = -1e18;
  for (int i = 1; i <= n; i++) {
    rec = premax[i - 1] * 2 - pre[i - 1] * 2 + sufmax[i - 1] * 2 - pre[n];
    if (rec > ans) {
      id2 = i;
      ans = rec;
    }
  }
  id1 = 0;
  for (int i = 1; i < id2; i++) {
    if (pre[i] > pre[id1]) id1 = i;
  }
  id3 = id2 - 1;
  for (int i = id2; i <= n; i++) {
    if (pre[i] > pre[id3]) id3 = i;
  }
  id2--;
  printf("%d %d %d\n", id1, id2, id3);
  return 0;
}
