Reminder: in case of any technical issues, you can use the lightweight website
m1.codeforces.com,
m2.codeforces.com,
m3.codeforces.com.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Ciel and Flipboard

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputFox Ciel has a board with *n* rows and *n* columns, there is one integer in each cell.

It's known that *n* is an odd number, so let's introduce . Fox Ciel can do the following operation many times: she choose a sub-board with size *x* rows and *x* columns, then all numbers in it will be multiplied by -1.

Return the maximal sum of numbers in the board that she can get by these operations.

Input

The first line contains an integer *n*, (1 ≤ *n* ≤ 33, and *n* is an odd integer) — the size of the board.

Each of the next *n* lines contains *n* integers — the numbers in the board. Each number doesn't exceed 1000 by its absolute value.

Output

Output a single integer: the maximal sum of numbers in the board that can be accomplished.

Examples

Input

3

-1 -1 1

-1 1 -1

1 -1 -1

Output

9

Input

5

-2 0 0 0 -2

0 -2 0 -2 0

0 0 -2 0 0

0 -2 0 -2 0

-2 0 0 0 -2

Output

18

Note

In the first test, we can apply this operation twice: first on the top left 2 × 2 sub-board, then on the bottom right 2 × 2 sub-board. Then all numbers will become positive.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/08/2020 19:08:05 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|