Miser is a manager of a services company. N employees work under him who gets paid for each task they complete. His company recently has got N tasks to complete. He plans to assign single task to each of his employee so that all the work can be completed faster.

Like his name suggests, Miser doesn't want to spend money or wants to spend least to get his work done. He continues the same behaviour, plans to get his N tasks done with minimum cost. He calls all his employees and tells them about the tasks. He asks them to tell the amount they would take for each task.

Now he would give the details to you and wants you to calculate the least amount he has to spend to get all the tasks done with a condition that each employee gets only one task. Being a miser he would not pay you for doing his work but would gift you with a green tick.

Input Format:
First line has an integer N(number of employees and also number of tasks).
Next N lines have N space separated integers. \(j^{th}\) number in \(i^{th}\) line represents cost set by \(i^{th}\) employee for \(j^{th}\) task.

Output Format:
Print the minimum cost as mentioned in problem statement.

Constraints:

\(1 \le N \le 10\)
\(1 \le A[i][j] \le 200\)