import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static int solve(int[] A) {
        int c=Math.pow(A.length,A.length); 
        int[] B= new int[c];
       int max = A[0];
        for(int f=1;f<A,length-1;f++)
        {if(A[i]>max)
        max=A[i];}
        for(int k=0;k<A.lenght-1;k++){
            for(int i=0<i<A.length-k-1)
            {j=i+k;
            B[j]=max;}}
       int d=0;
        for(int l=0;l<B.lenth;l++)
            d+=B[i];
 return d;       
       
        
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] a = new int[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        int result = solve(A);
        System.out.println(result);
        in.close();
    }
}