// Arup Guha
// 5/11/2016
// Solution to USACO 2016 Bronze February Problem: Circular Barn

import java.util.*;
import java.io.*;

public class cbarn {

	public static void main(String[] args) throws Exception {

		// Read in data.
		BufferedReader stdin = new BufferedReader(new FileReader("cbarn.in"));
		int n = Integer.parseInt(stdin.readLine().trim());
		int[] cows = new int[n];
		for (int i=0; i<n; i++)
			cows[i] = Integer.parseInt(stdin.readLine().trim());

		int res = Integer.MAX_VALUE;

		// Try each rotation (starting at index i.
		for (int i=0; i<n; i++) {
			int cur = 0;

			// Just use mod to wraparound.
			for (int j=i; j<i+n; j++)
				cur += (j-i)*cows[j%n];
			res = Math.min(res, cur);
		}

		// Write result.
		PrintWriter out = new PrintWriter(new FileWriter("cbarn.out"));
		out.println(res);
		out.close();
		stdin.close();
	}
}