Problem: Description

KULASIS is the name of a system developed and operated by the Higher Education Research and Development Promotion Organization for the purpose of providing information on common subjects throughout the university on the Web, supporting students and faculty members, and improving services. KULASIS started with the development of the online syllabus in 2003, and has gradually expanded the system to include Web bulletin boards, course registration, grades (scoring registration, scoring confirmation from students).
Students can use functions such as confirmation of academic affairs information (class cancellations, class changes, reports), course registration, and scoring confirmation from both inside and outside the university from a personal computer or mobile phone. The number of logins exceeds 10,000 on many days, and it has become widespread as an academic affairs information system at Kyoto University, and is indispensable for taking common courses throughout the university. We are developing this KULASIS so that it can be applied not only to common subjects throughout the university, but also to undergraduate specialized courses and graduate schools.
http://www.z.k.kyoto-u.ac.jp/introduction_kulasis.html

Q, a student at Kyoto University, was logged in to KULASIS to form a late syllabus. When I was wondering which subject I was going to enter, KULASIS suddenly gave off a dazzling light and moved to another page.
The page to which the transition was made was as shown in the figure below. The subject name and evaluation (impossible, acceptable, good, excellent) are written in the 5x5 square, and 16 ● buttons are arranged on the grid.
It was Q that I did not know what happened, but apparently when I press the ● button on the grid, the evaluation of the subjects in the upper right, lower right, upper left, and lower left is not possible → Yes, Yes → Good, Good → Excellent, Excellent → Impossible.


<image>


You can press the ● button as many times as you like.
I'm not sure if KULASIS has been rewritten by someone or if I'm dreaming, but if I can confirm my grades with this, Q wanted to get as good a grade as possible.
Confident that he was collecting a lot of credits, Q decided to maximize his fighting power in preparation for his assignment to the laboratory six months later than the number of credits itself.
Combat power is the total value of the evaluation of each subject converted into impossible → 0 points, acceptable → 60 points, good → 70 points, excellent → 80 points. It is thought (in the Q department) to show how superior it is.

Now that the subjects displayed on the KULASIS screen and their evaluations are given, please describe the program that outputs the maximum value of the combat power that can be obtained.



Input

The number of test cases is given on the first line of input. The number of test cases is guaranteed to be 100 or less.
From the second line onward, 5x5 numbers are lined up, and the evaluation of the subject displayed on the KULASIS screen is given, and 1,2,3,4 correspond to impossible, acceptable, good, and excellent, respectively.
If it is 0, no subject is registered in that frame.
The test cases are separated by a blank line.

Output

Output the maximum value of combat power that can be obtained for each test case.

Example

Input

5

1 1 0 3 3
1 1 0 3 3
0 0 0 0 0
2 2 0 4 4
2 2 0 4 4

1 1 1 0 0
1 1 1 1 0
1 0 1 1 0
0 0 1 1 1
1 1 1 1 1

0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0

4 3 4 3 4
3 4 3 4 3
4 3 4 3 4
3 4 3 4 3
4 3 4 3 4

2 2 2 2 2
0 0 0 2 0
2 2 0 2 0
2 2 0 2 0
0 0 0 2 0


Output

1280
1420
0
1920
1020

Solution (in CPP):

Solution:
// 基本テンプレート
 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
 
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

const int S = 4000;
const int N = 5;
using vector2D = vector< vector<int> >;

int base_x[] = {0, 0, 1, 1};
int base_y[] = {0, 1, 0, 1};
vector< vector<int> > cand;

void init_cand() {
    for(int i=0; i<4; i++) {
        for(int j=0; j<4; j++) {
            for(int k=0; k<4; k++) {
                for(int x=0; x<4; x++) {
                    vector<int> v = {i, j, k, x};
                    cand.push_back(v);
                }
            }
        }
    }
}

int get_hash(vector<int> v) {
    int ret = 0;
    for(int i=0; i<N; i++) {
        ret *= 5;
        ret += v[i];
    }
    return ret;
}

int get_point(vector<int> v) {
    int ret = 0;
    vector<int> pts = {0, 0, 60, 70, 80};
    for(int i=0; i<N; i++) {
        ret += pts[ v[i] ];
    }
    return ret;
}

int solve(vector2D board) {
    map< vector<int>, int > dp, swp;
    dp[ board[0] ] = 0;
    for(int k=0; k<4; k++) {
        for(auto e : dp) {
            vector<int> pat = e.first;
            for(auto v : cand) {
                vector< vector<int> > tmp(2, vector<int>(N));
                tmp[0] = pat;
                tmp[1] = board[k+1];

                for(int i=0; i<4; i++) {
                    int shift = v[i];
                    for(int j=0; j<4; j++) {
                        int x = base_x[j], y = base_y[j] + i;

                        if(tmp[x][y] == 0) continue;
                        tmp[x][y] = (tmp[x][y] - 1 + shift) % 4 + 1;
                    }
                }

                int score = dp[pat] + get_point(tmp[0]);
                if(k == 3) score += get_point(tmp[1]);

                vector<int> nxt = tmp[1];
                if(!swp.count(nxt) || swp[nxt] < score) {
                    swp[nxt] = score;
                }
            }
        }

        swap(dp, swp);
    }

    int ans = 0;
    for(auto x : dp) {
        chmax(ans, x.second);
    }
    return ans;
}
 
signed main() {
    init_cand();
    int T; cin >> T;
    while(T--) {
        vector2D board(N, vector<int>(N));
        for(int i=0; i<N; i++) {
            for(int j=0; j<N; j++) {
                cin >> board[i][j];
            }
        }

        cout << solve(board) << endl;
    }
    return 0;
}