#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <cassert>
using namespace std;
inline int toInt (string s) {int v; istringstream sin(s); sin>>v; return v;}
template<class T> inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EACH(t,i,c) for(t::iterator i=(c).begin();i!=(c).end();++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS=1e-10;
const double PI=acos(-1.0);

int main(){
	int N;
	cin>>N;
	REP(z,N){
		vvi map(5,vi(5,0));
		REP(i,5){
			REP(j,5){
				cin>>map[i][j];
			}
		}
		int maxCount=0;
		REP(i,5){
			REP(j,5){
				if(map[i][j]==0)	continue;
				else{
					REP(k,5){
						REP(l,5){
							if(k<i||l<j)	continue;
							else{
								int count=0;
								FOR(m,i,k+1){
									FOR(n,j,l+1){
										if(map[m][n]==1)	count++;
										else goto ng;
									}
								}
								maxCount=max(maxCount,count);
								ng:;
							}
						}
					}
				}
			}
		}
		cout<<maxCount<<endl;
	}
}