UVA-871

#include <bits/stdc++.h>

using namespace std;
//using namespace chrono;

typedef long long ll;
typedef vector< int > vi;
typedef vector< ll > vl;
typedef map<int, int > mp;
typedef pair< int, int > pii;

#define pb push_back
#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define F first
#define S second

#define debug cout << -1 << endl;
#define REP(i, a, b) for(int i=a; i<b; i++)
#define f0r(i, n) for (int i = 0; i < n; ++i)
#define f0r1(i, n) for (int i = 1; i <= n; ++i)
#define r0f(i, n) for(int i=n-1; i>=0; i--)
#define r0f1(i, n) for(int i=n; i>=1; i--)
#define fore(a, x) for (auto& a : x)
#define fori(i, a, b) for (int i = (a); i < (b); ++i)

#define MP make_pair
#define UB upper_bound
#define LB lower_bound
#define nw cout << "\n"

#define issq(x) (((ll)(sqrt((x))))*((ll)(sqrt((x))))==(x))
#define rev(v) reverse(v.begin(),v.end())
#define asche cerr<<"Ekhane asche\n";
#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<ll>())
#define all(v) v.begin(),v.end()
#define mnv(v) *min_element(v.begin(),v.end())
#define mxv(v) *max_element(v.begin(),v.end())
#define valid(tx,ty) (tx>=0 && tx<n && ty>=0 && ty<m)
#define one(x) __builtin_popcount(x)
//#define pop pop_back
#define setPrec(x) cout << fixed << setprecision(x)
#define sz(a) (int)a.size()
//#define fin cin
//#define fout cout
const int INF = 1e9;
const ll MOD = (ll)1e9+7;
const ll INFL = 1e18;
const ll mnINF = -1e18;
const double diff = 10e-6;
const int maxn = 200005;
const double PI = acos(-1);
using namespace std;

int dx[] = {-1, 0, 1};
int dy[] = {-1, 0, 1};

// int dx[] = {-1, 0, 0, 1};
// int dy[] = {0, -1, 1, 0};

bool vis[30][30];
string arr[30];

int n, m;
int cnt = 0;
string temp = "";
bool flag = true;

void dfs(int x, int y)
{
    vis[x][y] = true;
    cnt++;
    for(int i=0; i<3; i++) {
        for(int j=0; j<3; j++) {
            int newX = x+dx[i];
            int newY = y+dy[j];
            if(valid(newX, newY) && !vis[newX][newY] && arr[newX][newY]=='1') {
                dfs(newX, newY);
            }
        }
    }
}

void solve()
{
    n = 0, m = 0;
    string sss;
    while(getline(cin, sss)) {
        if(sss.size()) {
            arr[n] = sss;
            n++;
        }
        else {
            break;
        }
    }
    m = arr[0].size();
    memset(vis, false, sizeof(vis));

    int ans = 0;
    for(int i=0; i<n; i++) {
        for(int j=0; j<m; j++) {
            if(!vis[i][j] && arr[i][j]=='1') {
                cnt = 0;
                dfs(i, j);
                ans = max(ans, cnt);
            }
        }
    }
    // nw;
    cout << ans << "\n";
}

void setIO(string name = "") { // name is nonempty for USACO file I/O

    ios_base::sync_with_stdio(0); cin.tie(0); // see Fast Input & Output

    // alternatively, cin.tie(0)->sync_with_stdio(0);

    if (name.size()) {

        freopen((name+".in").c_str(), "r", stdin); // see Input & Output

        freopen((name+".out").c_str(), "w", stdout);

    }

}

int main()
{
#ifndef ONLINE_JUDGE
    freopen("inputf.in", "r", stdin);
    freopen("outputf.in", "w", stdout);
#endif
    //setIO("breedflip");
    // FastIO;
    int t;
    t = 1;
    cin >> t;
    string str;
    getline(cin, str);
    getline(cin, str);
    for(int i=0; i<t; i++) {
        if(i) nw;
        // cout << "Case " << i+1 << ": ";
        solve();
    }
    return 0;
}