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 <stdio.h>
#include <vector>
#include <algorithm>
#include <math.h>
#include <stack>

using namespace std;

struct Info{
	Info(){ left = height = 0;}
	Info(int arg_left,int arg_height){
		left = arg_left;
		height = arg_height;
	}
	int left,height;
};

int main(){

	int n,max_s,tmp,tmp_h,table[6][6];

	stack<Info> S;
	Info work;

	scanf("%d",&n);

	for(int loop = 0; loop < n; loop++){

		for(int i = 0; i < 6; i++)table[0][i] = 0;
		for(int i = 0; i < 6; i++)table[i][5] = 0;

		max_s = 0;

		for(int i = 1; i <= 5; i++){

			for(int k = 0; k < 5; k++){
				scanf("%d",&table[i][k]);
				if(table[i][k] == 1){
					table[i][k] = table[i-1][k]+1;
				}
			}

			getchar();

			tmp_h = table[i][0];
			S.push(Info(0,tmp_h));

			for(int k = 1; k < 6; k++){
				if(table[i][k] > tmp_h){
					S.push(Info(k,table[i][k]));
					tmp_h = table[i][k];
				}else if(table[i][k] == tmp_h){
					//Do nothing
				}else{
					while(S.empty() == false && S.top().height >= table[i][k]){
						work = S.top();
						S.pop();
						tmp = (k - work.left)*work.height;
						max_s = (max_s >= tmp)?max_s:tmp;
					}
					tmp_h = table[i][k];
					S.push(Info(work.left,table[i][k]));
				}
			}
		}
		while(!S.empty())S.pop();
		printf("%d\n",max_s);
	}

	return 0;
}