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
import java.util.*;

public class Main {

	void run() {
		Scanner cin = new Scanner(System.in);
		int T = cin.nextInt();
		while (T-- > 0) {
			int[][] MAP = new int[5][5];
			for (int i = 0; i < 5; i++) {
				for (int j = 0; j < 5; j++) {
					MAP[i][j] = cin.nextInt();
				}
			}
			int ans = 0;
			for (int x1 = 0; x1 < 5; x1++) {
				for (int x2 = x1 + 1; x2 <= 5; x2++) {
					for (int y1 = 0; y1 < 5; y1++) {
						for (int y2 = y1 + 1; y2 <= 5; y2++) {
							Boolean check = true;
							for(int x=x1;x<x2;x++){
								for(int y=y1;y<y2;y++){
									if(MAP[x][y]==0)check=false;
								}
							}
							if(check){
								ans=Math.max(ans, (x2-x1)*(y2-y1));
							}
						}
					}
				}
			}
			System.out.println(ans);
		}
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO ツ篠ゥツ督ョツ青カツ青ャツつウツづェツつスツδ?ソツッツドツ・ツスツタツブ
		new Main().run();
	}

}