/*  This Code is Submitted by wywcgs for Problem 2304 on 2006-08-02 at 22:09:47 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 1024;

int main()
{
	int i, j, n, fc[N], nc[N];
	
	while(scanf("%d", &n) != EOF && n != 0) {
		for(i = 0; i < n; i++) scanf("%d", &fc[i]);
		bool can = true;
		for(i = 1; i < n; i++) {
			for(j = 0; j < n; j++) { scanf("%d", &nc[j]); nc[j] -= fc[j]; }
			for(j = 1; j < n && can; j++)
				if(nc[j] != nc[0]) can = false;
		}
		printf("%shomogeneous\n", can ? "" : "not ");
	}
	
	return 0;
}