SSORT  Silly Sort
Your younger brother has an assignment and needs some help. His teacher gave him a sequence of numbers to be sorted in ascending order. During the sorting process, the places of two numbers can be interchanged. Each interchange has a cost, which is the sum of the two numbers involved.
You must write a program that determines the minimal cost to sort the sequence of numbers.
Input
The input file contains several test cases. Each test case consists of two lines. The first line contains a single integer n (n>1), representing the number of items to be sorted. The second line contains n different integers (each positive and less than 1000), which are the numbers to be sorted.
The input is terminated by a zero on a line by itself.
Output
For each test case, the output is a single line containing the test case number and the minimal cost of sorting the numbers in the test case.
Place a blank line after the output of each test case.
Example
Input: 3 3 2 1 4 8 1 2 4 5 1 8 9 7 6 6 8 4 5 3 2 7 0 Output: Case 1: 4 Case 2: 17 Case 3: 41 Case 4: 34
hide comments
jrseinc:
20200823 21:57:25
What a wonderful problem took me a day to get the concept. Just try to find cycles and make sure that you are using **minimum** element for swaps.


kkuntal990:
20200526 10:31:57
Output is format seems so unnecessary. Made me rethink my solution :( 

sky_scraper:
20190512 12:47:38
I felt really good after solving this problem 

priyanshul:
20190122 14:33:12
There is no constraint on N, nice problem. 

jcode777:
20180824 23:26:34
@supriyanta Ditto dude. Silly Format. 

supriyanta:
20180823 15:37:54
Output format cost 1 wa. :( 

pk845:
20180711 06:38:20
+1 to setter! 

imkiller:
20180603 08:25:34
Tricky One 

tushar8848:
20171224 17:57:45
swap 1 & 6 first Last edit: 20171224 18:54:47 

sidiq_ha:
20171101 07:50:38
How to get 41 for the third case? 
Added by:  Fudan University Problem Setters 
Date:  20080103 
Time limit:  0.5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: C99 ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ACM/ICPC World Final 2002 (unofficial testdata) 