import java.util.*;

public class MarbleMadness
{
   public static void main(String[] args)
   {
      new MarbleMadness(new Scanner(System.in));
   }

   // Solve the tower case
   int oo = 987654321;
   int solve(int N, int[] vs)
   {
      int full = (1<<3)-1;

      int[][] dp = new int[N+1][1<<3];
      for (int i=0; i<N+1; i++)
         Arrays.fill(dp[i], oo);
      dp[0][2] = 0;
      for (int i=0; i<N; i++)
      {
         for (int m=0; m<(1<<3); m++)
         {
            // Place a tower here
            if ((m&1) == 0)
            {
               int nm = ((m<<1)|1)&full;
               dp[i+1][nm] = Math.min(dp[i+1][nm], dp[i][m]);
            }

            // Place no tower here
            if ((m&3) != 0)
            {
               int nm = (m<<1)&full;
               dp[i+1][nm] = Math.min(dp[i+1][nm], dp[i][m]+vs[i]);
            }
         }
      }

      int res = oo;
      for (int m=0; m<(1<<3); m++)
         if ((m & 3) != 0)
            res = Math.min(res, dp[N][m]);
      return res;
   }

   public MarbleMadness(Scanner in)
   {         
         int N = in.nextInt();
         int[] vs = new int[N];
         for (int i=0; i<N; i++)
            vs[i] = in.nextInt();
      
         int cost = 0, minMoves = 0;
         if (N == 2)
         {
            cost = vs[0]+vs[1];
            minMoves = Math.min(vs[0], vs[1]);
         }
         else if (N > 2)
         {
            for (int v : vs)
               cost += 2*v;
            int[] nxt = new int[N-2];
            for (int i=1; i<N-1; i++)
               nxt[i-1] = vs[i];
            
            nxt[0] += vs[0];
            minMoves += vs[0];
            nxt[N-3] += vs[N-1];
            minMoves += vs[N-1];
            minMoves += solve(N-2, nxt);
         }

         System.out.printf("%d %d%n", cost, minMoves);
      }
}