Most Powerful
题号:NC15832
时间限制:C/C++/Rust/Pascal 2秒,其他语言4秒
空间限制:C/C++/Rust/Pascal 32 M,其他语言64 M
64bit IO Format: %lld

题目描述

Recently, researchers on Mars have discovered N powerful atoms. All of them are different. These atoms have some properties. When two of these atoms collide, one of them disappears and a lot of power is produced. Researchers know the way every two atoms perform when collided and the power every two atoms can produce.

You are to write a program to make it most powerful, which means that the sum of power produced during all the collides is maximal. 

输入描述:

There are multiplecases. The first line of each case has an integer N (2 <= N <= 10), whichmeans there are N atoms: A1, A2, ... , AN.Then N lines follow. There are N integers in each line. The j-th integer on thei-th line is the power produced when Ai and Aj collidewith Aj gone. All integers are positive and not larger than 10000.

The last case isfollowed by a 0 in one line.

There will be no morethan 500 cases including no more than 50 large cases that N is 10.

输出描述:

Output the maximalpower these N atoms can produce in a line for each case.
示例1

输入

复制
2
0 4
1 0
3
0 20 1
12 0 1
1 10 0
0

输出

复制
4
22