Karnaugh is a poor farmer who has a very small field. He wants to reclaim wasteland in the kingdom to get a new field. But the king who loves regular shape made a rule that a settler can only get a rectangular land as his field. Thus, Karnaugh should get the largest rectangular land suitable for reclamation.

The map of the wasteland is represented with a 5 x 5 grid as shown in the following figures, where '1' represents a place suitable for reclamation and '0' represents a sandy place. Your task is to find the largest rectangle consisting only of 1's in the map, and to report the size of the rectangle. The size of a rectangle is defined by the number of 1's in it. Note that there may be two or more largest rectangles of the same size.


<image>
Figure 1. The size of the largest rectangles is 4.
There are two largest rectangles (shaded).


<image>
Figure 2. The size of the largest rectangle is 3.
There is one largest rectangle (shaded).





Input

The input consists of maps preceded by an integer m indicating the number of input maps.


m
map1

map2

map3

...

mapm



Two maps are separated by an empty line.
Each mapk is in the following format:


p p p p p
p p p p p
p p p p p
p p p p p
p p p p p


Each p is a character either '1' or '0'. Two p's in the same line are separated by a space character. Here, the character '1' shows a place suitable for reclamation and '0' shows a sandy place. Each map contains at least one '1'.

Output

The size of the largest rectangle(s) for each input map should be shown each in a separate line.

Example

Input

3
1 1 0 1 0
0 1 1 1 1
1 0 1 0 1
0 1 1 1 0
0 1 1 0 0

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

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


Output

4
3
8
#include <iostream>

using namespace std;

int map[5][5];

bool isRec(int y, int x, int h, int w)
{
    for (int i = 0; i < h; ++i)
        for (int j = 0; j < w; ++j)
            if (map[y + i][x + j] == 0)
                return false;
    return true;
}

int Check()
{
    int ans = 0;
    for (int h = 5; h >= 1; --h)
        for (int w = 5; w >= 1; --w)
            for (int i = 0; i + h <= 5; ++i)
                for (int j = 0; j + w <= 5; ++j)
                    if (isRec(i, j, h, w))
                        ans = max(ans, h * w);
    return ans;
}

int main()
{
    int testcase;

    cin >> testcase;
    while (testcase--) {
        // Input
        for (int i = 0; i < 5; ++i)
            for (int j = 0; j < 5; ++j)
                cin >> map[i][j];

        cout << Check() << endl;
    }

    return 0;
}