#include <bits/stdc++.h>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int n,i,j,q,lat,iv,jv,d[505][505][10];
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>d[i][j][0];
    for(lat=1;(1<<lat)<=n;lat++)
        for(i=1;i+(1<<lat)-1<=n;i++)
            for(j=1;j+(1<<lat)-1<=n;j++)
                d[i][j][lat]=min(min(d[i][j][lat-1],d[i][j+1<<(lat-1)][lat-1]),min(d[i+1<<(lat-1)][j][lat-1],d[i+1<<(lat-1)][j+1<<(lat-1)][lat-1]));
    fin>>q;
    for(i=1;i<=q;i++)
    {
        fin>>iv>>jv>>lat;
        int e=0;
        int p=1;
        while(p*2<=lat)
        {
            e++;
            p*=2;
        }
       fout<<min(min(d[i][j][e],d[i+lat-p][j][e]),min(d[i][j+lat-p][e],d[i+lat-p][j+lat-p][e]))<<'\n';
    }

    return 0;
}