#include<stdio.h>
#include<algorithm>
const int maxm=10001;
int u[maxm];
void makeset()
{
    for(int i=1;i<maxm;i++)
        u[i]=i;
}
int Find(int x)
{
    if(x!=u[x])
    {
        u[x]=Find(u[x]);
    }
    return u[x];

}
int Union(int a1,int a2)
{
    int r1=Find(a1);
    int r2=Find(a2);
    if(r1!=r2)
    {u[r2]=r1;
    return 1;
    }
    return 0;
}
using namespace std;
int main()
{
    int m,i,j,k,n,a,b;

    while(scanf("%d%d",&n,&m),n)
    {
        if(n<=0&&m>=0)
        {
           printf("Zero\n") ;
        }

            if(m<0&&(m-n-1)%2==0)
        {
            printf("Positive\n");
        }
        if(m<0&&(m-n)%2==0)
            printf("Negative\n");
        if(n>0) printf("Positive\n");
    }
    return 0;
}
