#![allow(unused_imports, unused_macros, dead_code)]

macro_rules! min {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = min!($($ys),*);
        if $x < t { $x } else { t }
    }}
}
macro_rules! max {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = max!($($ys),*);
        if $x > t { $x } else { t }
    }}
}
macro_rules! ewriteln {
    ($($args:expr),*) => { let _ = writeln!(&mut std::io::stderr(), $($args),*); };
}
macro_rules! trace {
    ($x:expr) => { ewriteln!(">>> {} = {:?}", stringify!($x), $x) };
    ($($xs:expr),*) => { trace!(($($xs),*)) }
}
macro_rules! put {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        if let Some(x) = it.next() { print!("{}", x); }
        for x in it { print!(" {}", x); }
        println!("");
    }};
    ($x:expr) => { println!("{}", $x) };
    ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}

const M: i64 = 1_000_000_007;

struct Permutation { n: usize, idx: usize }
impl Permutation {
    fn new(n: usize) -> Permutation {
        Permutation { n: n, idx: 0 }
    }
}
impl Iterator for Permutation {
    type Item = Vec<usize>;
    fn next(&mut self) -> Option<Vec<usize>> {
        let mut r = vec![0; self.n];
        let mut idx = self.idx;
        for k in 1..self.n {
            r[k] = idx % (k + 1);
            idx /= k + 1;
        }
        if idx > 0 { return None }
        r.reverse();
        let mut b = vec![true; self.n];
        b[r[0]] = false;
        for k in 1..self.n {
            let mut count = 0;
            for j in 0..self.n {
                if b[j] {
                    if count == r[k] {
                        r[k] = j;
                        b[j] = false;
                        break;
                    }
                    count += 1;
                }
            }
        }
        self.idx += 1;
        return Some(r)
    }
}

fn naiive(xs: &Vec<(i64, i64)>) -> i64 {
    let n = xs.len();
    let mut mx = 0;
    for p in Permutation::new(n) {
        let mut r = 0;
        for i in 0..n {
            let (pos, a) = xs[p[i]];
            r += (pos - i as i64).abs() * a;
        }
        mx = max!(mx, r);
    }
    for p in Permutation::new(n) {
        let mut r = 0;
        for i in 0..n {
            let (pos, a) = xs[p[i]];
            r += (pos - i as i64).abs() * a;
        }
        if mx == r {
            trace!(&(0..n).map(|i| xs[p[i]]).collect::<Vec<_>>());
        }
    }
    mx
}

fn score(xs: &Vec<(i64, i64)>) -> i64 {
    let mut r = 0;
    let n = xs.len();
    for i in 0..n {
        let (pos, a) = xs[i];
        r += (pos - i as i64).abs() * a;
    }
    r
}

fn main() {
    let mut sc = Scanner::new();
    let n: usize = sc.cin();
    let xs: Vec<(i64, i64)> = (0..n).map(|i| {
        let a: i64 = sc.cin();
        (i as i64, a)
    }).collect();

    let mut ans = 0;
    for m in 0..=n {
        let mut left: Vec<_> = xs[0..m].iter().collect();
        let mut right: Vec<_> = xs[m..].iter().collect();
        right.sort_by_key(|item| item.1); right.reverse();
        left.sort_by_key(|item| item.1);
        let k = right.len();
        let z: Vec<_> = (0..n).map(|i| if i < k { right[i] } else { left[i - k] }).map(|&x|x).collect();
        ans = max!(ans, score(&z));
    }
    put!(ans);

}

use std::io::{self, Write};
use std::str::FromStr;
use std::collections::VecDeque;

struct Scanner { stdin: io::Stdin, buffer: VecDeque<String>, }
impl Scanner {
    fn new() -> Self { Scanner { stdin: io::stdin(), buffer: VecDeque::new() } }
    fn cin<T: FromStr>(&mut self) -> T {
        while self.buffer.len() == 0 {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
        self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
    }
    fn chars(&mut self) -> Vec<char> { self.cin::<String>().chars().collect() }
    fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> { (0..n).map(|_| self.cin()).collect() }
}
