齐次平方
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int map[1010][1010];
int n,i,j;
while(~scanf("%d",&n)){
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&map[i][j]);
book ok=1;
for(i=1;i<n;i++)
{
for(j=1;j<n;j++)
{
if(map[i][j]+map{i+1}[j+1]!=map{i}[j+1]+map[i+1][j]) ok=0;
if(ok==0) break;
}
if(ok==0) break;
}
if(ok)printf("homogeneous\n");
else printf("not homogeneous\n");
}
return 0;
}