Sightseeing Tour#3406
KM city has sightseeing areas. Currently every pair of area is connected by a bidirectional road.
However for some reason, Mr. KM, the mayor of this city, decided to make all of these roads one-way. It costs C_{ij} dollars to renovate the road between area and area to a one-way road from area to area . Of course, Mr. KM is economical and wants to minimize the total cost of the renovation.
On the other hand, because tourism is the most important industry for KM city, there must exist a tour that goes through all the sightseeing areas, visiting each area exactly once. The first and last area of the path need not be the same. Can you calculate the minimum total cost required for the renovation, given this situation?
The first line contains the number of sightseeing area (1 \le N \le 100). Next lines describe the integer matrix , where the -th element of the -th row of the input describes C_{ij} (0 \le C_{ij} \le 1000000). For each , you can assume C_{ii} is always zero.
Output the minimum cost in a line.
Example 1