
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

struct H
{
	int m, a, b;
};

int main()
{
	int n;
	while(cin >> n && n)
	{
		vector<pint> v;

		rep(i, n)
		{
			int a, b, m;
			cin >> m >> a >> b;

			v.push_back(mp(a, m));
			v.push_back(mp(b, -m));
		}

		sort(ALL(v));

		int m = 0;
		rep(i, v.size())
		{
			m += v[i].second;
			for(; v[i].first == v[i + 1].first && i +  1 < v.size(); i++)
				m += v[i + 1].second;
			

			if(150 < m)
			{
				cout << "NG" << endl;
				goto ng;
			}
		}

		cout << "OK" << endl;
ng:
		;
	}
}