#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<iomanip>
using std::cin,std::cout;
#define double long double
double const eps=1e-12;
int n,x[100010],y[100010],z[100010];
struct node{
	double x,y;
	node():x(),y(){}
	node(double a,double b):x(a),y(b){}
	node(std::pair<int,int> a):x(a.first),y(a.second){}
	friend node operator +(node x,node y){return node(x.x+y.x,x.y+y.y);}
	friend node operator -(node x,node y){return node(x.x-y.x,x.y-y.y);}
};
auto cross=[](auto x,auto y)->long long{
	return 1ll*x.first*y.second-1ll*x.second*y.first;
};
double dis(node a,node b){
	return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
node locate(node a,node b,node c){
	double a1=(b.x-a.x)*2,b1=(b.y-a.y)*2,c1=b.x*b.x+b.y*b.y-a.x*a.x-a.y*a.y,a2=(c.x-a.x)*2,b2=(c.y-a.y)*2,c2=c.x*c.x+c.y*c.y-a.x*a.x-a.y*a.y;
	return node((c2*b1-c1*b2)/(a2*b1-a1*b2),(c2*a1-c1*a2)/(b2*a1-b1*a2));
}
bool eq(double a,double b){
	return std::abs(a-b)<eps||std::abs(a-b)/std::max(a,b)<eps;
}
std::vector<std::pair<int,int>> as,at;
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n;
	int mx=0;
	for(int i=1;i<=n;i++)cin>>x[i]>>y[i]>>z[i],mx=std::max(mx,z[i]);
	for(int i=1;i<=n;i++){
		if(z[i]==0||z[i]==mx) at.emplace_back(x[i],y[i]);
		else as.emplace_back(x[i],y[i]);
	}
	std::ranges::sort(as);
	as.resize(std::ranges::unique(as).begin()-as.begin());
	std::ranges::sort(at);
	at.resize(std::ranges::unique(at).begin()-at.begin());
	if(as.size()==0){
		cout<<"probably\n";
		return 0;
	}
	if(as.size()>=3){
		node o=locate(as[0],as[1],as[2]);
		double r=dis(o,as[0]);
		for(node u:as)if(!eq(dis(u,o),r)){
			cout<<"not a penguin\n";
			return 0;
		}
		for(node u:at)if(!(dis(u,o)<r||eq(dis(u,o),r))){
			cout<<"not a penguin\n";
			return 0;
		}
		cout<<"probably\n";
		return 0;
	}
	if(as.size()==1){
		for(auto &[x,y]:at) x-=as[0].first,y-=as[0].second;
		for(auto it=at.begin();it!=at.end();it++) if(it->first==0&&it->second==0){
			at.erase(it);
			break;
		}
		std::sort(at.begin(),at.end(),[](auto x,auto y){
			return std::atan2(x.second,x.first)<std::atan2(y.second,y.first);
		});
		at.resize(std::unique(at.begin(),at.end(),[](auto x,auto y)->bool{
			return cross(x,y)==0&&1ll*x.first*y.first>=0&&1ll*x.second*y.second>=0;
		})-at.begin());
		if(at.size()<=1){
			cout<<"probably\n";
			return 0;
		}
		at.push_back(at[0]);
		int n=at.size();
		for(int i=1;i<n;i++){
			if(cross(at[i],at[i-1])>0){
				cout<<"probably\n";
				return 0;
			}
		}
		cout<<"not a penguin\n";
		return 0;
	}
	auto a1=as[0],a2=as[1];
	if(a1.second==a2.second){
		std::swap(a1.first,a1.second);
		std::swap(a2.first,a2.second);
		for(auto &[u,v]:at) std::swap(u,v);
	}
	if(a2.second<a1.second) std::swap(a1,a2);
	for(auto &[x,y]:at) x-=a1.first,y-=a1.second;
	a2.first-=a1.first,a2.second-=a1.second;
	double R=-1e99,L=1e99;
	for(auto p:at){
		long long cr=cross(a2,p);
		if(cr==0){
			if(p.second<=a2.second&&p.second>=0) continue;
			else{
				cout<<"not a penguin\n";
				return 0;
			}
		}else if(cr<0){
			R=std::max(locate(node(0,0),a2,p).x,R);
		}else{
			L=std::min(locate(node(0,0),a2,p).x,L);
		}
	}
	if(R<L||eq(R,L)) cout<<"probably\n";
	else cout<<"not a penguin\n";
	return 0;
}