Connect Ropes with Minimum Cost

Given 'N' ropes, each having different lengths, your task is to connect these ropes into one single rope. The cost to connect two particular ropes is equal to the sum of their lengths. Please determine the minimum cost required to connect all the ropes.

Input:

The first line contains the integer 'N', representing the number of ropes.
The second line contains 'N' space-separated integers indicating the lengths of the ropes, denoted as a1, a2, a3, ..., an.

Output:

The output should be a single integer - the minimum cost to connect all the ropes into one.

Example:

Input:

4
4 3 2 6

Output:

29

Constraints:

• 1 <= N <= 10^5
• 1 <= ai <= 10^9

Note:

You are not required to print anything; the function implementation will handle the processing and returning of results.