#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

// dummy one
struct AVL {
	std::vector<int> data;
	void insert(int n) {
		data.push_back(n);
		std::sort(data.begin(), data.end());
	}
	void remove(int n) {
		auto itr = std::find(data.begin(), data.end(), n);
		assert(itr != data.end());
		data.erase(itr);
	}
	int operator [] (int i) {
		return data[i];
	}
	size_t size() { return data.size(); }
};

int main() {
	int n = ri();
	int a[n];
	for (int i = 0; i < n; i++) a[i] = ri();
	std::vector<int64_t> median_left[n + 1];
	std::vector<int64_t> median_right[n + 1];
	for (int i = 0; i <= n; i++) {
		median_left[i].resize(n / (i + 1));
		median_right[i].resize(n / (i + 1));
	}
	int sq = sqrt(n);
	for (int i = 0; i < sq; i++) {
		{
			int head = 0;
			int tail = 0;
			AVL set;
			for (int j = 0; i < (int) median_left[j].size(); j++) {
				// j + 1
				while (head < (j + 1) * (i + 1)) set.insert(a[head++]);
				while (tail < (j + 1) * i) set.remove(a[tail++]);
				assert(set.size());
				median_left[j][i] = set[(set.size() - 1) / 2];
			}
		}
		{
			int head = n - 1;
			int tail = n - 1;
			AVL set;
			for (int j = 0; i < (int) median_left[j].size(); j++) {
				// j + 1
				while (head >= n - (j + 1) * (i + 1)) set.insert(a[head--]);
				while (tail >= n - (j + 1) * i) set.remove(a[tail--]);
				assert(set.size());
				median_right[j][i] = set[(set.size() - 1) / 2];
			}
		}
	}
	for (int i = 0; i <= n; i++) {
		for (int j = sq; j < (int) median_left[i].size(); j++) {
			std::vector<int> sorted;
			for (int k = j * (i + 1); k < (j + 1) * (i + 1); k++) sorted.push_back(a[k]);
			std::sort(sorted.begin(), sorted.end());
			median_left[i][j] = sorted[(sorted.size() - 1) / 2];
		}
		for (int j = sq; j < (int) median_right[i].size(); j++) {
			std::vector<int> sorted;
			for (int k = n - (j + 1) * (i + 1); k < n - j * (i + 1); k++) sorted.push_back(a[k]);
			std::sort(sorted.begin(), sorted.end());
			median_right[i][j] = sorted[(sorted.size() - 1) / 2];
		}
	}
	int64_t res = 0;
	for (int i = 0; i < n; i++) {
		int max_index_sum = (int) median_left[i].size() - 2;
		for (int j = 0; j + 1 < (int) median_left[i].size(); j++) median_left[i][j + 1] += median_left[i][j];
		for (int j = 0; j + 1 < (int) median_left[i].size(); j++) median_left[i][j + 1] = std::max(median_left[i][j + 1], median_left[i][j]);
		for (int j = 0; j + 1 < (int) median_right[i].size(); j++) median_right[i][j + 1] += median_right[i][j];
		for (int j = 0; j + 1 < (int) median_right[i].size(); j++) median_right[i][j + 1] = std::max(median_right[i][j + 1], median_right[i][j]);
		int64_t cur = 0;
		for (int j = 0; j + 1 < (int) median_left[i].size(); j++) cur = std::max(cur, median_left[i][j] + median_right[i][max_index_sum - j]);
		cur = std::max(cur, median_left[i].back());
		cur = std::max(cur, median_right[i].back());
		res = std::max(res, cur * (i + 1));
	}
	std::cout << res << std::endl;
	
	return 0;
}