#include using namespace std; const int N = 1e6 + 10; int a[N]; int n; int res; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { // 枚举每一列 int width = 1; // 往左走 for (int j = i - 1; j >= 0; j--) { if (a[j] < a[i]) break; width++; } // 往右走 for (int j = i + 1; j <= n; j++) { if (a[j] < a[i]) break; width++; } res = max(res, a[i] * width); } cout << res << endl; return 0; }